• Title/Summary/Keyword: Block redundancy

Search Result 87, Processing Time 0.032 seconds

Distributed Quasi-Orthogonal Space-Time Block Code for Four Transmit Antennas with Information Exchange Error Mitigation

  • Tseng, Shu-Ming;Wang, Shih-Han
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.10
    • /
    • pp.2411-2429
    • /
    • 2013
  • In this paper, we extend the case of information exchange error mitigation for the distributed orthogonal space-time block code (DOSTBC) for two transmit antennas to distributed quasi-orthogonal space-time block code (DQOSTBC) for four transmit antennas. A rate 1 full-diversity DQOSTBC for four transmit antennas is designed. The code matrix changes according to different information exchange error cases, so full diversity is maintained even if not all information exchange is correct. We also perform analysis of the pairwise error probability. The performance analysis indicates that the proposed rate 1 DQOSTBC outperforms rate 1/2 DOSTBC for four transmit antennas at the same transmission rate, which is confirmed by the simulation results.

A study on Improvement of the performance of Block Motion Estimation Using Neighboring Search Point (인접 탐색점을 이용한 블록 움직임 추정의 성능 향상을 위한 연구)

  • 김태주;진화훈;김용욱;허도근
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.143-146
    • /
    • 2000
  • Motion Estimation/compensation(ME/MC) is one of the efficient interframe ceding techniques for its ability to reduce the high redundancy between successive frames of an image sequence. Calculating the blocking matching takes most of the encoding time. In this paper a new fast block matching algorithm(BMA) is developed for motion estimation and for reduction of the computation time to search motion vectors. The feature of the new algorithm comes from the center-biased checking concept and the trend of pixel movements. At first, Motion Vector(MV) is searched in ${\pm}$1 of search area and then the motion estimation is exploited in the rest block. The ASP and MSE of the proposed search algorithm show good performance.

  • PDF

THE DESIGN OF AN EFFICIENT LOAD BALANCING ALGORITHM EMPLOYING BLOCK DESIGN

  • Chung, Il-Yong;Bae, Yong-Eun
    • Journal of applied mathematics & informatics
    • /
    • v.14 no.1_2
    • /
    • pp.343-351
    • /
    • 2004
  • In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on network. This processing requires $O(v^2)$ communication overhead, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k + 1, 1)-configured network applying a symmetric balanced incomplete block design, where $v\;=\;k^2$\;+\;k\;+\;1$. Our algorithm needs only $O(\sqrt[v]{v})$ communication overhead and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.

A Study on HAUSAT-1 Satellite Fault-Tolerant System Architecture Design

  • Kim, Young-Hyun;Chang, Young-Keun
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.4 no.2
    • /
    • pp.37-50
    • /
    • 2003
  • A next generation small satellite HAUSAT-1, the first picosatellite developed in Korea, is being developed as one of the international CubeSat program by Space System Research Lab. of Hankuk Aviation University. A fault-tolerant incremental design methodology has been addressed in this paper. In this study, the effect of system redundancy on reliability was in details analyzed in accordance with the implementation of fault-tolerant system. Four different system recovery levels are proposed for HAUSAT-1 fault-tolerant system optimization. As a result, the HAUSAT-1 fault-tolerant system architecture design and reliability analysis has acquired about 11% reliability improvement.

Design of redundancy interface between TCMS and ATC system, and brake control of free-axle system (TCMS와 ATC장치간 인터페이스 이중계 구현 및 무축제동 제어방안)

  • Hong Gu-sun;Han Shin;Han Jeong-soo
    • Proceedings of the KSR Conference
    • /
    • 2004.10a
    • /
    • pp.1461-1466
    • /
    • 2004
  • Recently Domestic EMU's on board signal systems are gradually changed form Cab signal(Fix Block) to Distance-to-go. Interfaces with on board signal system, TCMS Redundancy structure is mainly required. This paper suggest Manaul/Automatic Driving based on TCMS-ATC interface and design of backup system which is operated by Stan-by Computer when one of it's Local Interface Unit(LIU) is out of oder. For the purpose of Precision Train Stop, Distance-to-go signal system require accuracy speed. Free-axle structure is required for this system This paper suggest Free-axle braking system that lack of brake-force is compensated by the distributed brake-force using TCMS. And one of braking system has out of order, compensation of brake-force for Free-axle system. Then we prove our design to Complete Car Test

  • PDF

Bitrate Reduction by Interleaving DCT Coefficients for Differential Images (차이영상에 대한 DCT 계수의 끼워짜기를 이용한 비트율 감소)

  • 이상길;양경호;이충웅
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.7
    • /
    • pp.14-23
    • /
    • 1993
  • This paper proposes an algorithm to reduce the bitrate for transmission of MCP(motion compensated prediction) error signals. Many digital image coders have recently employed hybrid coding schemes which perform motion compensation, DCT transform, quantization, and variable length coding. The variable length coding compresses the quantized DCT coefficient data by removing their statistical redundancy. But some DCT blocks have the interblock statistical redundancy as well as the intrablock one. To utilize both of them, the DCT blocks are classified into the interleaving group and the non-interleaving group. And then each DCT blocks in the interleaving group are is encoded independently, and the DCT blocks in the interleaving group are encoded after interleaving the DCT coefficients. Through the simulations, it is shown that the proposed method outperforms the conventional method in which each DCT block is encoded independently.

  • PDF

HDTV Essential Padding Area in Digital Broadcasting (디지털 방송에서 HDTV 필수 부가영역)

  • Han, Chan-Ho;Yoon, In-Seop
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.6
    • /
    • pp.853-864
    • /
    • 2017
  • HD padding area is essential redundancy in HD broadcasting. It is possible to use this padding area for the purpose of improving DTV broadcasting services. For utilization of this area, The bit of a service data was converted to black and white $8{\times}8$ block image. Converted block images are compressed with active video and are delivered to a receiver as only DC coefficients in a video stream. video quality is not effected by the proposed method, and service data was perfectly recovered in receiver without errors by using block average and threshold. The proposed utilization of HD essential padding area can possibly overcome the limited transmission stream rate with the bandwidth of HD broadcasting. If service data in transport or video stram were transferred using this padding area, it is possible to improve video quality with expanded video stream rate. Additionally, because the proposed methods are based on well-established standards, it is also useful for world-wide HD broadcasting systems such as ATSC, DVB, and IPTV.

Adaptive block tree structure for video coding

  • Baek, Aram;Gwon, Daehyeok;Son, Sohee;Lee, Jinho;Kang, Jung-Won;Kim, Hui Yong;Choi, Haechul
    • ETRI Journal
    • /
    • v.43 no.2
    • /
    • pp.313-323
    • /
    • 2021
  • The Joint Video Exploration Team (JVET) has studied future video coding (FVC) technologies with a potential compression capacity that significantly exceeds that of the high-efficiency video coding (HEVC) standard. The joint exploration test model (JEM), a common platform for the exploration of FVC technologies in the JVET, employs quadtree plus binary tree block partitioning, which enhances the flexibility of coding unit partitioning. Despite significant improvement in coding efficiency for chrominance achieved by separating luminance and chrominance tree structures in I slices, this approach has intrinsic drawbacks that result in the redundancy of block partitioning data. In this paper, an adaptive tree structure correlating luminance and chrominance of single and dual trees is presented. Our proposed method resulted in an average reduction of -0.24% in the Y Bjontegaard Delta rate relative to the intracoding of JEM 6.0 common test conditions.

Removal of Complexity Management in H.263 Codec for A/VDelivery Systems

  • Jalal, Ahmad;Kim, Sang-Wook
    • 한국HCI학회:학술대회논문집
    • /
    • 2006.02a
    • /
    • pp.931-936
    • /
    • 2006
  • This paper presents different issues of the real-time compression algorithms without compromising the video quality in the distributed environment. The theme of this research is to manage the critical processing stages (speed, information lost, redundancy, distortion) having better encoded ratio, without the fluctuation of quantization scale by using IP configuration. In this paper, different techniques such as distortion measure with searching method cover the block phenomenon with motion estimation process while passing technique and floating measurement is configured by discrete cosine transform (DCT) to reduce computational complexity which is implemented in this video codec. While delay of bits in encoded buffer side especially in real-time state is being controlled to produce the video with high quality and maintenance a low buffering delay. Our results show the performance accuracy gain with better achievement in all the above processes in an encouraging mode.

  • PDF

An Efficient VLC Table Prediction Scheme for H.264 Using Weighting Multiple Reference Blocks (H.264 표준에서 가중된 다중 참조 블록을 이용한 효율적인 VLC 표 예측 방법)

  • Heo, Jin;Oh, Kwan-Jung;Ho, Yo-Sung
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.39-42
    • /
    • 2005
  • H.264, a recently proposed international video coding standard, has adopted context-based adaptive variable length coding (CAVLC) as the entropy coding tool in the baseline profile. By combining an adaptive variable length coding technique with context modeling, we can achieve a high degree of redundancy reduction. However, CAVLC in H.264 has weakness that the correct prediction rate of the variable length coding (VLC) table is low in a complex area, such as the boundary of an object. In this paper, we propose a VLC table prediction scheme considering multiple reference blocks; the same position block of the previous frame and the neighboring blocks of the current frame. The proposed algorithm obtains the new weighting values considering correctness of the VLC table for each reference block. Using this method, we can enhance the prediction rate of the VLC table and reduce the bit-rate.

  • PDF