On the Overflow Problem in Finite Precision Turbo Decoding Message Passing

Much attention has been paid recently to the so-called layered decoding of LDPC codes, also known as turbo-decoding message passing (TDMP). The TDMP algorithm for decoding LDPC codes is known to possess some desirable features, such as fast convergence speed, reduced memory requirements and reduced implementation complexity in comparison with standard two-phase message passing algorithm. In this paper we analyze an important issue connected with hardware implementation of TDMP algorithm, namely the finite precision representation of messages influence on the decoding performance. Constrained dynamic range of the finite precision representation of messages entails overflow errors. We present an analysis revealing that in the subsequent decoding iterations, the subtraction of non-overflowed intrinsic message from overflowed extrinsic message is a source of errors that have substantial impact on the decoding results. The analysis is confirmed by simulation results showing significant performance loss. However this performance loss can be almost completely eliminated with a basic modifications in the messages computation algorithm. Effectiveness of the presented modifications is confirmed by simulation results obtained with hardware TDMP decoder implementation that has been developed.

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

[2]  Lei Yang,et al.  Code construction and FPGA implementation of a low-error-floor multi-rate low-density Parity-check code decoder , 2006, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3]  Ajay Dholakia,et al.  Efficient implementations of the sum-product algorithm for decoding LDPC codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

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

[6]  Chaitali Chakrabarti,et al.  Architecture-Aware LDPC Code Design for Multiprocessor Software Defined Radio Systems , 2009, IEEE Transactions on Signal Processing.

[7]  D.E. Hocevar,et al.  A reduced complexity decoder architecture via layered decoding of LDPC codes , 2004, IEEE Workshop onSignal Processing Systems, 2004. SIPS 2004..

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

[9]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[10]  H. Vincent Poor,et al.  Finding All Small Error-Prone Substructures in LDPC Codes , 2009, IEEE Transactions on Information Theory.

[11]  Tong Zhang,et al.  Block-LDPC: a practical LDPC coding system design approach , 2005, IEEE Trans. Circuits Syst. I Regul. Pap..

[12]  Naresh R. Shanbhag,et al.  High-throughput LDPC decoders , 2003, IEEE Trans. Very Large Scale Integr. Syst..

[13]  W. Ebel.  Convergence of iterative decoding for fixed-point implementations , 2002, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002..

[14]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

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

[16]  W. Marsden.  I and J , 2012 .

[17]  Ajay Dholakia,et al.  Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

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

[19]  Jong-Yeol Lee,et al.  A 1-Gb/s flexible LDPC decoder supporting multiple code rates and block lengths , 2008, IEEE Transactions on Consumer Electronics.

[20]  S. Litsyn,et al.  An efficient message-passing schedule for LDPC decoding , 2004, 2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel.

[21]  Luca Fanucci,et al.  Low-Complexity Architectures of a Decoder for IEEE 802.16e LDPC Codes , 2007, 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD 2007).

[22]  Kai Zhang,et al.  High-throughput layered decoder implementation for quasi-cyclic LDPC codes , 2009, IEEE Journal on Selected Areas in Communications.

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

[24]  Li Ping,et al.  Decoding low density parity check codes with finite quantization bits , 2000, IEEE Communications Letters.

[25]  Mohammad M. Mansour,et al.  A Turbo-Decoding Message-Passing Algorithm for Sparse Parity-Check Matrix Codes , 2006, IEEE Transactions on Signal Processing.

[26]  Jeremy Thorpe,et al.  Memory-efficient decoding of LDPC codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[27]  W. Sułek.  Pipeline processing in low-density parity-check codes hardware decoder , 2011 .

[28]  Zhongfeng Wang,et al.  Flexible LDPC Decoder Design for Multigigabit-per-Second Applications , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.