Compression of a binary source with side information using parallelly concatenated convolutional codes

This work presents an efficient structured binning scheme for solving the noiseless distributed source coding problem with parallel concatenated convolutional codes, or turbo codes. The novelty in the proposed scheme is the introduction of a syndrome former and an inverse syndrome former to efficiently and optimally exploit an existing turbo code without the need to redesign or modify the code structure and/or decoding algorithms. Extension of the proposed approach to serially concatenated codes is also briefed and examples including conventional turbo codes and asymmetric turbo codes are given to show the efficiency and the general applicability of the approach. Simulation results reveal good performance which is close to the theoretic limit.

[1]  Patrick Mitran,et al.  Coding for the Slepian-Wolf problem with turbo codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[2]  Te Sun Han,et al.  Universal coding for the Slepian-Wolf data compression system and the strong converse theorem , 1994, IEEE Trans. Inf. Theory.

[3]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[4]  Imre Csiszár.  Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[5]  S. Shamai,et al.  Capacity of channels with uncoded-message side-information , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.

[6]  Zixiang Xiong,et al.  Compression of binary sources with side information using low-density parity-check codes , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

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

[9]  Rick S. Blum,et al.  An Efficient SF-ISF Approach for the Slepian-Wolf Source Coding Problem , 2005, EURASIP J. Adv. Signal Process..

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

[11]  Zixiang Xiong,et al.  Distributed compression of binary sources using conventional parallel and serial concatenated convolutional codes , 2003, Data Compression Conference, 2003. Proceedings. DCC 2003.

[12]  Jing Li,et al.  A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

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

[14]  Aaron D. Wyner,et al.  On source coding with side information at the decoder , 1975, IEEE Trans. Inf. Theory.

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

[16]  G. Forney,et al.  Trellis shaping , 1992, IEEE/CAM Information Theory Workshop at Cornell.

[17]  Daniel J. Costello,et al.  A note on asymmetric turbo-codes , 1999, IEEE Communications Letters.

[18]  Shlomo Shamai,et al.  Capacity of channels with uncoded side information , 1995, Eur. Trans. Telecommun..

[19]  Sergio D. Servetto,et al.  Lattice quantization with side information , 2000, Proceedings DCC 2000. Data Compression Conference.

[20]  Rick S. Blum,et al.  Slepian-Wolf coding for nonuniform sources using turbo codes , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[21]  K. Ramchandran,et al.  Distributed source coding using syndromes (DISCUS): design and construction , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).