Sparse Decoding of Low Density Parity Check Codes Using Margin Propagation

One of the key factors underlying the popularity of Low-density parity-check (LDPC) code is its iterative decoding algorithm that is amenable to efficient hardware implementation. Even though different variants of LDPC iterative decoding algorithms have been studied for its error-correcting properties, an analytical basis for evaluating energy efficiency of LDPC decoders has not been reported. In this paper, we present a framework of a parameterized LDPC decoding algorithm that can be optimized to produce sparse representation of communication messages used in iterative decoding. The sparsity of messages is determined by its differential entropy and has been used as a theoretical metric for determining the energy efficiency of an iterative LDPC decoder. At the core of the proposed algorithm is margin propagation (MP) which approximates the log-sum-exp function used in conventional sum-product (SP) decoders by a piecewise linear (PWL) function. Using Monte-Carlo simulations, we demonstrate that the MP decoding leads to a significant reduction in message entropy compared to a conventional SP decoder, while incurring a negligible performance penalty (less than 0.03dB). The proposed work therefore lays the foundation for design of parameterized LDPC decoders whose bit-errorrate performance can be effectively traded-off with respect to different energy efficiency constraints as required by different set of applications.

[1]  A. Blanksby,et al.  A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder , 2001, IEEE J. Solid State Circuits.

[2]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[3]  Mohammad M. Mansour,et al.  A 640-Mb/s 2048-bit programmable LDPC decoder chip , 2006, IEEE Journal of Solid-State Circuits.

[4]  C. Plett,et al.  An 80-Mb/s 0.18-/spl mu/m CMOS analog min-sum iterative decoder for a (32,8,10) LDPC code , 2005, Proceedings of the IEEE 2005 Custom Integrated Circuits Conference, 2005..

[5]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[6]  A. J. Blanksby,et al.  A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder , 2001, IEEE J. Solid State Circuits.

[7]  Hayder Radha,et al.  Optimally Mapping an Iterative Channel Decoding Algorithm to a Wireless Sensor Network , 2007, 2007 IEEE International Conference on Communications.

[8]  H. Loeliger,et al.  Probability propagation and decoding in analog VLSI , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[9]  Joachim Hagenauer,et al.  Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.

[10]  Shantanu Chakrabartty,et al.  Analog Iterative LDPC Decoder Based on Margin Propagation , 2007, IEEE Transactions on Circuits and Systems II: Express Briefs.

[11]  C. Plett,et al.  A 0.18-$muhbox m$CMOS Analog Min-Sum Iterative Decoder for a (32,8) Low-Density Parity-Check (LDPC) Code , 2006, IEEE Journal of Solid-State Circuits.

[12]  Nhan Nguyen,et al.  Low-voltage CMOS circuits for analog iterative decoders , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[13]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[14]  Frank R. Kschischang,et al.  A 3.3-Gbps bit-serial block-interlaced min-sum LDPC decoder in 0.13-μm CMOS , 2007, 2007 IEEE Custom Integrated Circuits Conference.