• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.1051-1052
• /
• 2006

In this paper, we propose a puncturing scheme to design low-density parity-matrix (LDPC) codes for unequal error protection (UEP). Two different puncturing schemes are compared. Simulation results show that proposed puncturing scheme outperforms regular puncturing scheme for more important bits. Future work is to find an optimized puncturing patten for UEP irregular LDPC codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.950-958
• /
• 2007

This paper presents an efficient packet loss resilient scheme for real-time video transmission over the Internet. By analyzing the temporal and spatial dependencies in inter- and intra-frames, we assign forward error correction codes (FEC) across video packets for minimizing the effect of error concealment and error propagation from packet loss. To achieve optimal allocation of FEC codes, we formulate the effect of packet loss on video quality degradation as packet distortion model. Then we propose an unequal FEC assignment scheme with low complexity based on packet correction rate, which uses the packet distortion model and includes channel status information. Simulation results show that the proposed FEC assignment scheme gives substantial improvement for the received video quality in packet lossy networks. Furthermore the proposed scheme achieves relatively smaller degradation of video quality with higher packet loss rates.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.563-564
• /
• 2011

본 논문에서 우리는 unequal loss protection(ULP) 알고리즘을 기반으로 패킷이 손실될 수 있는 망 환경에서 인지적으로 재구성된 영상의 왜곡을 최소화하는 방법을 제안한다. 알고리즘에는 2가지의 주요 요인이 있다. 첫째, 인간 시각 체계의 균일하지 않은 분포의 함수로 압축된 영상에 가중치를 준다. 둘째, 패킷은 오류 전파가 일어나지 않도록 하면서 각각의 group of picture(GOP)내에서 시간적인 중요성이 할당된다. 프레임의 인지적인 중요성과 GOP의 계층적인 중요성을 동시에 고려하여, 제안하는 ULP알고리즘은 인간 시각적으로 가장 중요한 지역의 크기를 식별하여 효율적인 forword error correction(FEC) 알고리즘을 수행한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.4
• /
• pp.195-205
• /
• 2014

The ultra-high definition television (UHDTV) has been considered as a next generation broadcsating service. However the conventional digital terrestrial transmission system cannot afford the required transmission data rate of UHDTV, and thus adopting ultra-high order constellation, such as 4096-QAM, into the conventional DTT systems has been studied. In particular, when the ultra-high order constellation is adopted into the digital video broadcasting-2nd generation terrestrial (DVB-T2) unequal-error protection (UEP) properties of a codeword of an error correction coding and ultra-high order constellations should be properly matched by bit mapper in order to enhance the decoding performance. Because long codeword results in a heavy computational complexity to design the bit mapper, the DVB-T2 divided it into cascaded blocks, the bit interleaver and the bit-to-cell DEMUX, and there have been many researches related to each block. However, there are few published study related to design methodology of bit interleaver. In this respect, this paper proposes a design methodology of the bit interleaver and presents bit interleavers of 1024-QAM and 4096-QAM according to the proposed design algorithm. The newly designed interleavers improved the decoding performance of the error correction coding by maximally 0.6 dB SNR over both of AWGN and random fading channel.

• ETRI Journal
• /
• v.34 no.6
• /
• pp.900-910
• /
• 2012

In this paper, a novel trellis-coded spatial modulation (TCSM) design method is presented and analyzed. Inspired by the key idea of trellis-coded modulation (TCM), the detailed analysis is firstly provided on the unequal error protection performance of spatial modulation constellation. Subsequently, the Ungerboeck set partitioning rule is proposed and applied to develop a general method to design the novel TCSM schemes. Different from the conventional TCSM approaches, the novel one based on the Ungerboeck set partitioning rule has similar properties as the classic TCM, which has simple but effective code design criteria. Moreover, the novel designed schemes are robust and adaptive to the generalized Rician fading channels, which outperform the traditional TCSM ones. For examples, the novel 4-, 8-, and 16-state TCSM schemes are constructed by employing different transmit antennas and different modulation schemes in different channel conditions. Simulation results clearly demonstrate the advantages of the novel TCSM schemes over the conventional ones.

• Journal of the Semiconductor & Display Technology
• /
• v.14 no.1
• /
• pp.51-53
• /
• 2015

H.264/AVC is international video coding standard, which shows improved code and efficiency than the existing video standards. H.264/AVC proposes data partitioning method that considerably to be an effective layering technique which separates important addressing data from the residual data. UEP(Unequal Error Protection) turbo code of H.264/AVC uses retransmission system to get the UEP effectively. However, Data partitioning system of H.264/AVC is inefficient method in turbo code of H.264/AVC. Based on this observation, we propose the new UEP turbo code algorithm that reconstructs input sequence of turbo code without retransmission system.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.19-22
• /
• 1998

In this study, the efficient channel coding method combined with CS-ACELP is proposed. The same convolutional coder and Viterbi decoder of COMA mobile communication system is used as channel coder. To make the best available use of limited channel coding redundancy, unequal error protection of punctured convolutional coder is used for variable reate allocation. But, the overall code rate is given by 2. The performance of proposed coder is analyzed and simulated in a Rayleigh fading channel. Experimental results show that the objective and subjective speech quality of variable rate channel coding methods are superior to those of non-variable channel coding method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2266-2284
• /
• 2012

Recent studies have indicated that a significant improvement in wireless video throughput can be achieved by Cross Layer Design with Side-information (CLDS) protocols. In this paper, we derive the operational rate of a CLDS protocol operating over a realistic wireless channel. Then, a Rate-Distortion (R-D) empirical model for above-capacity Scalable Video Coding (SVC) is deduced to estimate the loss of video quality incurred under inaccurate rate estimation scenarios. Finally, we develop a novel Unequal Error Protection (UEP) scheme which leverages the characteristics of LDPC codes to reduce the distortion of video quality in case of typically-observed burst wireless errors. The efficacy of the proposed rate adaptation architecture over conventional protocols is demonstrated by realistic video simulations using actual IEEE 802.11b wireless traces.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.321-324
• /
• 2000

채널만을 고려한 부호화 방법보다 소스의 특성을 이용해 채널 부호화를 수행하는 것이 더 효율적이라는 사실은 일반적으로 잘 알려져 있다. 따라서 소스의 특성을 이용한 채널 부호화 방법은 중요한 연구과제이며 이에 대한 많은 연구가 진행되었다. 이러한 연구 결과로써 IP-SCCC(Interleaved puncturing serially concatenated convolutional codes)는 터보코드와 마찬가지로 반복복호가 가능하고 가변 부호율의 채널부호화를 수행할 수 있는 특징을 갖는다. 본 논문에서는 영상에 대한 웨이블렛 변환의 다른 스케일간의 자기 유사성을 이용한 SPIHT(set partitioning in hierarchical tree) 알고리즘으로 부호화된 정지영상에 대해 IP-SCCC를 사용한 UEP(unequal error protection) 채널부호화 방법을 제시한다. 또한 레일리 페이딩과 부가 백색 가우시안 잡음이 동시에 존재하는 채널을 모델링해서 실험을 수행하고 제안 방법의 성능을 검증한다.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.155-162
• /
• 2011

The scalable extension of the H.264/AVC video coding standard (SVC) demonstrates superb adaptability in video communications. Joint source and channel coding (JSCC) has been shown to be very effective for such scalable video consisting of parts of different significance. In this paper, a new JSCC scheme for SVC transmission over packet loss channels is proposed which performs two-dimensional optimization on the quality layers of each frame in a rate-distortion (R-D) sense as well as on the temporal hierarchical structure of frames under dependency constraints. To compute the end-to-end R-D points of a frame, a novel reduced trellis algorithm is developed with a significant reduction of complexity from the existing Viterbi-based algorithm. The R-D points of frames are sorted under the hierarchical dependency constraints and optimal JSCC solution is obtained in terms of the best R-D performance. Experimental results show that our scheme outperforms the existing scheme of [13] with average quality gains of 0.26 dB and 0.22 dB for progressive and non-progressive modes respectively.