Distributed coding using punctured quasi-arithmetic codes for memory and memoryless sources

This paper considers the use of punctured quasi-arithmetic (QA) codes for the Slepian-Wolf problem. These entropy codes are defined by finite state machines for memory-less and first-order memory sources. Puncturing an entropy coded bit-stream leads to an ambiguity at the decoder side. The decoder makes use of a correlated version of the original in order to remove this ambiguity. A complete DSC scheme based on QA encoding with side information at the decoder is presented. The proposed scheme is adapted to memoryless and first-order memory sources. Simulation results reveal that the proposed scheme is efficient in terms of decoding performance for short sequences compared to well-known DSC using channel codes.

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

[2]  Bernd Girod,et al.  Rate-adaptive codes for distributed source coding , 2006, Signal Process..

[3]  Paul G. Howard,et al.  Practical Implementations of Arithmetic Coding 1 , 1992 .

[4]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[5]  Marco Dalai,et al.  The DISCOVER codec: Architecture, Techniques and Evaluation , 2007, PCS 2007.

[6]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

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

[8]  Enrico Magli,et al.  Symmetric Distributed Arithmetic Coding of Correlated Sources , 2007, 2007 IEEE 9th Workshop on Multimedia Signal Processing.

[9]  Michelle Effros,et al.  Lossless and near-lossless source coding for multiple access networks , 2003, IEEE Trans. Inf. Theory.

[10]  J. Vitter,et al.  Practical Implementations of Arithmetic Coding , 1991 .

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

[12]  Enrico Magli,et al.  Distributed Arithmetic Coding , 2007, IEEE Communications Letters.

[13]  Kannan Ramchandran,et al.  PRISM: A new robust video coding architecture based on distributed compression principles , 2002 .

[14]  Joachim Hagenauer,et al.  LOSSLESS TURBO SOURCE CODING WITH DECREMENTAL REDUNDANCY , 2004 .

[15]  Michel Kieffer,et al.  Asymptotic Error-Correcting Performance of Joint Source-Channel Schemes based on Arithmetic Coding , 2006, 2006 IEEE Workshop on Multimedia Signal Processing.

[16]  Steven W. McLaughlin,et al.  Rate-compatible punctured low-density parity-check codes with short block lengths , 2006, IEEE Transactions on Information Theory.

[17]  Mina Sartipi,et al.  Distributed source coding using short to moderate length rate-compatible LDPC codes: the entire Slepian-Wolf rate region , 2008, IEEE Transactions on Communications.

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

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

[20]  Rui Zhang,et al.  Wyner-Ziv coding of motion video , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[21]  Christine Guillemot,et al.  Overlapped Quasi-Arithmetic Codes for Distributed Video Coding , 2007, 2007 IEEE International Conference on Image Processing.

[22]  Thomas Guionnet,et al.  Soft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes , 2004, EURASIP J. Adv. Signal Process..

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

[24]  Luc Vandendorpe,et al.  Distributed Source Coding with Optimized Irregular Turbo Codes , 2007, 2007 IEEE International Conference on Communications.

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

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