Relaxed Half-Stochastic Belief Propagation

Low-density parity-check codes are attractive for high throughput applications because of their low decoding complexity per bit, but also because all the codeword bits can be decoded in parallel. However, achieving this in a circuit implementation is complicated by the number of wires required to exchange messages between processing nodes. Decoding algorithms that exchange binary messages are interesting for fully-parallel implementations because they can reduce the number and the length of the wires, and increase logic density. This paper introduces the Relaxed Half-Stochastic (RHS) decoding algorithm, a binary message belief propagation (BP) algorithm that achieves a coding gain comparable to the best known BP algorithms that use real-valued messages. We derive the RHS algorithm by starting from the well-known Sum-Product algorithm, and then derive a low-complexity version suitable for circuit implementation. We present extensive simulation results on two standardized codes having different rates and constructions, including low bit error rate results. These simulations show that RHS can converge faster on average than existing state-of-the-art decoding algorithms, leading to improvements in throughput and energy efficiency.

[1]  N. Varnica,et al.  Improvements in belief-propagation decoding based on averaging information from decoder and correction of clusters of nodes , 2006, IEEE Communications Letters.

[2]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[3]  Shie Mannor,et al.  A Relaxed Half-Stochastic Iterative Decoder for LDPC Codes , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[4]  Shu Lin,et al.  A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols , 2003, IEEE Communications Letters.

[5]  Shie Mannor,et al.  A Min-Sum Iterative Decoder Based on Pulsewidth Message Encoding , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

[7]  Shie Mannor,et al.  Majority-Based Tracking Forecast Memories for Stochastic LDPC Decoding , 2010, IEEE Transactions on Signal Processing.

[8]  Frank R. Kschischang,et al.  A bit-serial approximate min-sum LDPC decoder and FPGA implementation , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[9]  Martin J. Wainwright,et al.  An Efficient 10GBASE-T Ethernet LDPC Decoder Design With Low Error Floors , 2010, IEEE Journal of Solid-State Circuits.

[10]  P. Vontobel,et al.  Constructions of LDPC Codes using Ramanujan Graphs and Ideas from Margulis , 2000 .

[11]  Masoud Ardakani,et al.  Gear-shift decoding , 2006, IEEE Transactions on Communications.

[12]  Shuai Zhang,et al.  On the dynamics of the error floor behavior in regular LDPC codes , 2009, 2009 IEEE Information Theory Workshop.

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

[14]  Masoud Ardakani,et al.  A more accurate one-dimensional analysis and design of irregular LDPC codes , 2004, IEEE Transactions on Communications.

[15]  François Leduc-Primeau,et al.  High-throughput LDPC decoding using the RHS algorithm , 2012, Proceedings of the 2012 Conference on Design and Architectures for Signal and Image Processing.

[16]  Dariush Divsalar,et al.  Protograph based LDPC codes with minimum distance linearly growing with block size , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[17]  Jinghu Chen,et al.  Near optimum universal belief propagation based decoding of low-density parity check codes , 2002, IEEE Trans. Commun..

[18]  C. Winstead Stochastic Iterative Decoding on Factor Graphs , 2003 .

[19]  Amir H. Banihashemi,et al.  On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes , 2005, IEEE Transactions on Communications.

[20]  Shie Mannor,et al.  Lowering Error Floors Using Dithered Belief Propagation , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[21]  Amir H. Banihashemi,et al.  Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes , 2006, IEEE Transactions on Communications.

[22]  Tinoosh Mohsenin,et al.  A Low-Complexity Message-Passing Algorithm for Reduced Routing Congestion in LDPC Decoders , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[23]  Lara Dolecek,et al.  Lowering LDPC Error Floors by Postprocessing , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[24]  Aleksandar Kavcic,et al.  Augmented Belief Propagation Decoding of Low-Density Parity Check Codes , 2006, IEEE Transactions on Communications.

[25]  Hideki Imai,et al.  Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..