A Relaxed Half-Stochastic Iterative Decoder for LDPC Codes

This paper presents a Relaxed Half-Stochastic (RHS) low-density parity-check (LDPC) decoding algorithm that uses some elements of the sum-product algorithm (SPA) in its variable nodes, but maintains the low-complexity interleaver and check node structures characteristic of stochastic decoders. The algorithm relies on the principle of successive relaxation to convert binary stochastic streams to a log-likelihood ratio (LLR) representation. Simulations of a (2048, 1723) RS-LDPC code show that the RHS algorithm can outperform 100-iterations floating-point SPA decoding. We describe approaches for low-complexity implementation of the RHS algorithm. Furthermore, we show how the stochastic nature of the belief representation can be exploited to lower the error floor.

[1]  Ting Wang,et al.  LDPC codes and stochastic decoding for beyond 100 Gb/s optical transmission , 2008, 2008 34th European Conference on Optical Communication.

[2]  Lara Dolecek,et al.  Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices , 2009, IEEE Transactions on Communications.

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

[4]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[5]  Vincent C. Gaudet,et al.  Stochastic iterative decoders , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[7]  James C. Spall,et al.  Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.

[8]  G. Lechner,et al.  Decoding of LDPC codes with binary vector messages and scalable complexity , 2008, 2008 5th International Symposium on Turbo Codes and Related Topics.

[9]  D. West.  Introduction to Graph Theory , 1995 .

[10]  W.J. Gross,et al.  Stochastic Implementation of LDPC Decoders , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[11]  Shie Mannor,et al.  Stochastic decoding of LDPC codes , 2006, IEEE Communications Letters.

[12]  Shie Mannor,et al.  Fully Parallel Stochastic LDPC Decoders , 2008, IEEE Transactions on Signal Processing.

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

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

[15]  Thomas J. Richardson,et al.  Error Floors of LDPC Codes , 2003 .

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

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

[18]  Bruce F. Cockburn,et al.  A scalable LDPC decoder ASIC architecture with bit-serial message exchange , 2008, Integr..

[19]  V. Anantharam,et al.  Design of LDPC Decoders for Low Error Rate Performance , 2008 .

[20]  Shie Mannor,et al.  Tracking Forecast Memories in stochastic decoders , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[21]  Vincent C. Gaudet,et al.  Iterative decoding using stochastic computation , 2003 .