Low complexity full parallel Multi-Split LDPC decoder reusing sign wire of row processor

This paper proposes a novel modified Multi-Split LDPC decoder. In the proposed design, wires are shared to communicate not only the signs, but also the magnitudes of the messages among adjacent partitions of the LDPC codes. As a result, the proposed decoder can achieve significant coding gain over existing designs when the same word length is used. In addition, the error correcting performance of the proposed decoder is better than prior decoders even when shorter word length is adopted. Synthesis was carried out for fully-parallel decoders of an example (504, 252) LDPC code. To achieve similar performance as previous effort, the proposed decoder requires 13% hardware complexity.

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

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

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

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

[5]  Borivoje Nikolic,et al.  Low-density parity-check code constructions for hardware implementation , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[6]  In-Cheol Park,et al.  Low-latency area-efficient decoding architecture for shortened reed-solomon codes , 2012, 2012 International SoC Design Conference (ISOCC).

[7]  Tinoosh Mohsenin,et al.  Multi-Split-Row Threshold decoding implementations for LDPC codes , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[8]  Frank R. Kschischang,et al.  Multi-Gbit/sec low density parity check decoders with reduced interconnect complexity , 2005, 2005 IEEE International Symposium on Circuits and Systems.