Slepian-Wolf coding for nonuniform sources using turbo codes

The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem (Z. Tu et al., 2003). This paper studies the case when sources are i.i.d. but nonuniformly distributed. It is firstly shown that any algebraic binning scheme based on linear codes is optimal for nonuniform sources only asymptotically. Next two modifications are proposed to improve the performance of the turbo-binning scheme for nonuniform sources. The first is to carefully design the constituent encoder structures to maximally match the turbo code to the nonuniform source distribution, and the second is to use variable-length syndrome sequences to index the bins. Simulations show that the combination of both strategies can lead to an improvement of as much as 0.22 bit/symbol in overall compression rate for highly nonuniform sources.

[1]  Kannan Ramchandran,et al.  Distributed source coding using syndromes (DISCUS): design and construction , 2003, IEEE Trans. Inf. Theory.

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

[3]  Nam C. Phamdo,et al.  Source-channel optimized trellis codes for bitonal image transmission over AWGN channels , 1999, IEEE Trans. Image Process..

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

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

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

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

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

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

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

[11]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

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

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

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

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