Binary Wyner-Ziv code design based on compound LDGM-LDPC structures

In this paper, a practical coding scheme is designed for the binary Wyner-Ziv (WZ) problem by using nested low-density generator-matrix (LDGM) and low-density parity-check (LDPC) codes. This scheme contains two steps in the encoding procedure. The first step involves applying the binary quantization by employing LDGM codes and the second one is using the syndrome-coding technique by utilizing LDPC codes. The decoding algorithm of the proposed scheme is based on the Sum-Product (SP) algorithm with the help of a side information available at the decoder side. It is theoretically shown that the compound structure has the capability of achieving the WZ bound. The proposed method approaches this bound by utilizing the iterative message-passing algorithms in both encoding and decoding, although theoretical results show that it is asymptotically achievable.

[1]  Achilleas Anastasopoulos,et al.  Design and analysis of capacity-achieving codes and optimal receivers with low complexity , 2006 .

[2]  Ling Liu,et al.  Polar lattices are good for lossy compression , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

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

[4]  Catherine Douillard,et al.  Improving irregular turbo codes , 2011 .

[5]  Emin Martinian,et al.  Iterative Quantization Using Codes On Graphs , 2004, ArXiv.

[6]  Cesk,et al.  MINIMIZING EMBEDDING IMPACT IN STEGANOGRAPHY USING LOW DENSITY CODES , 2007 .

[7]  Jörg Kliewer,et al.  Algebraic constructions of graph-based nested codes from protographs , 2010, 2010 IEEE International Symposium on Information Theory.

[8]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

[9]  Huazhong Yang,et al.  Efficient construction of irregular codes with midterm block length and near-shannon performance , 2011, IET Commun..

[10]  Daniel Hillel Schonberg.  Practical distributed source coding and its application to the compression of encrypted data , 2007 .

[11]  Martin J. Wainwright,et al.  Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information , 2009, IEEE Transactions on Information Theory.

[12]  Martin J. Wainwright,et al.  Lossy Source Compression Using Low-Density Generator Matrix Codes: Analysis and Algorithms , 2010, IEEE Transactions on Information Theory.

[13]  Jun Chen,et al.  Achieving the rate-distortion bound with low-density generator matrix codes , 2010, IEEE Transactions on Communications.

[14]  Hamid Behroozi,et al.  Polar Codes for a Quadratic-Gaussian Wyner-Ziv Problem , 2013, ISWCS.

[15]  Jessica J. Fridrich,et al.  Binary quantization using Belief Propagation with decimation over factor graphs of LDGM codes , 2007, ArXiv.

[16]  Mina Sartipi,et al.  Lossy distributed source coding using LDPC codes , 2009, IEEE Communications Letters.

[17]  Zixiang Xiong,et al.  Nested convolutional/turbo codes for the binary Wyner-Ziv problem , 2003, Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429).

[18]  Mohamed M. Khairy,et al.  Selective max-min algorithm for low-density parity-check decoding , 2013, IET Commun..

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

[20]  Santhosh Kumar,et al.  Spatially-coupled codes for side-information problems , 2014, 2014 IEEE International Symposium on Information Theory.

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

[22]  Nicolas Macris,et al.  Approaching the Rate-Distortion Limit With Spatial Coupling, Belief Propagation, and Decimation , 2015, IEEE Transactions on Information Theory.