Capacity-Approaching Joint Source-Channel Coding for Asymmetric Channels with Low-Density Parity-Check Codes

By only sending the parity bits, joint source-channel coding can be natively achieved with low- density parity-check codes. However, the code ensemble design of optimal low-density parity-check codes for joint source-channel coding over asymmetric communication channels is difficult. To circumvent such a difficulty, source-channel adaptors is proposed in this paper. By using the source-channel adaptors both the asymmetric communication channel and the asymmetric correlation channel can be converted to symmetric channel and the conventional design method for channel coding can be used straightforwardly. To demonstrate the effectiveness of the proposed scheme, a code ensemble for joint source-channel coding over asymmetric communication channel is designed for binary memoryless sources with a range of a prior probability. The experiment results show that the performance of the devised codes is very close to the theory limit. Copyright © 2014 IFSA Publishing, S. L.

[1]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[2]  Zixiang Xiong,et al.  Joint source-channel coding of binary sources with side information at the decoder using IRA codes , 2002, 2002 IEEE Workshop on Multimedia Signal Processing..

[3]  Naixue Xiong,et al.  Distributed Video Coding: an overview of basics, research issues and solutions , 2012, Int. J. Ad Hoc Ubiquitous Comput..

[4]  H. Rumsey,et al.  Two Results On Binary-input Discrete Memoryless Channels , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[5]  Zixiang Xiong,et al.  Compression of binary sources with side information at the decoder using LDPC codes , 2002, IEEE Communications Letters.

[6]  Aaron D. Wyner,et al.  Recent results in the Shannon theory , 1974, IEEE Trans. Inf. Theory.

[7]  Wei Zhong,et al.  LDGM Codes for Channel Coding and Joint Source-Channel Coding of Correlated Sources , 2005, EURASIP J. Adv. Signal Process..

[8]  Bernd Girod,et al.  Distributed Video Coding , 2005, Proceedings of the IEEE.

[9]  Bernd Girod,et al.  Compression with side information using turbo codes , 2002, Proceedings DCC 2002. Data Compression Conference.

[10]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[11]  H. Vincent Poor,et al.  Joint Source and Channel Coding , 2010, IEEE Signal Processing Magazine.

[12]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[13]  Meir Feder,et al.  The uniform distribution as a universal prior , 2004, IEEE Transactions on Information Theory.

[14]  Jun Chen,et al.  The equivalence between slepian-wolf coding and channel coding under density evolution , 2009, IEEE Transactions on Communications.

[15]  H. Vincent Poor,et al.  Density evolution for asymmetric memoryless channels , 2005, IEEE Transactions on Information Theory.

[16]  Ying Zhao,et al.  Compression of correlated binary sources using turbo codes , 2001, IEEE Communications Letters.

[17]  A. Mitra,et al.  Modified Joint Channel Source Decoding structure for reliable image transmission , 2012, 2012 International Conference on Communication, Information & Computing Technology (ICCICT).

[18]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[19]  Paul H. Siegel,et al.  Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes , 2003, IEEE Trans. Inf. Theory.