A new coding scheme for the noisy-channel Slepian-Wolf problem: separate design and joint decoding

A new scheme for solving the Slepian-Wolf problem over noisy channels using serially concatenated codes is proposed. An outer low density parity check code is used to perform distributed source coding, and an inner convolutional code adds error protecting capability to the compressed data. A soft iterative joint source-channel decoder is performed, where the decoder side information is provided to the sub outer decoder instead of the sub inner decoder. The scheme is attractive since separate refining of compression rate (outer code) and error protection power (inner code) makes the design easy and the performance controllable, and joint iterative decoding exploits the power of the serial concatenated structure as much as possible. Simulations reveal encouraging joint decoding gain especially at low signal-to-noise ratios.

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

[2]  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.

[3]  Kannan Ramchandran,et al.  Distributed source coding: symmetric rates and applications to sensor networks , 2000, Proceedings DCC 2000. Data Compression Conference.

[4]  Rick S. Blum,et al.  Compression of a binary source with side information using parallelly concatenated convolutional codes , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

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

[6]  Fady Alajaji,et al.  Turbo codes for nonuniform memoryless sources over noisy channels , 2002, IEEE Communications Letters.

[7]  Zixiang Xiong,et al.  A distributed source coding technique for highly correlated images using turbo-codes , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

[9]  Kannan Ramchandran,et al.  Distributed source coding using syndromes (DISCUSS): design and construction , 1999 .

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

[11]  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..

[12]  Patrick Mitran,et al.  Turbo source coding: a noise-robust approach to data compression , 2002, Proceedings DCC 2002. Data Compression Conference.

[13]  Tatsuto Murayama.  Statistical Mechanics of Linear Compression Codes in Network Communication , 2001 .

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

[15]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

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

[17]  Shlomo Shamai,et al.  Systematic Lossy Source/Channel Coding , 1998, IEEE Trans. Inf. Theory.

[18]  Javier Garcia-Frías,et al.  Joint source-channel decoding of correlated sources over noisy channels , 2001, Proceedings DCC 2001. Data Compression Conference.