A Low-Complexity Message-Passing Algorithm for Reduced Routing Congestion in LDPC Decoders

A low-complexity message-passing algorithm, called Split-Row Threshold, is used to implement low-density parity-check (LDPC) decoders with reduced layout routing congestion. Five LDPC decoders that are compatible with the 10GBASE-T standard are implemented using MinSum Normalized and MinSum Split-Row Threshold algorithms. All decoders are built using a standard cell design flow and include all steps through the generation of GDS II layout. An Spn = 16 decoder achieves improvements in area, throughput, and energy efficiency of 4.1 times, 3.3 times, and 4.8 times, respectively, compared to a MinSum Normalized implementation. Postlayout results show that a fully parallel Spn = 16 decoder in 65-nm CMOS operates at 195 MHz at 1.3 V with an average throughput of 92.8 Gbits/s with early termination enabled. Low-power operation at 0.7 V gives a worst case throughput of 6.5 Gbits/s-just above the 10GBASE-T requirement-and an estimated average power of 62 mW, resulting in 9.5 pj/bit. At 0.7 V with early termination enabled, the throughput is 16.6 Gbits/s, and the energy is 3.7 pJ/bit, which is 5.8× lower than the previously reported lowest energy per bit. The decoder area is 4.84 mm2 with a final postlayout area utilization of 97%.

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

[2]  L. Litwin,et al.  Error control coding , 2001 .

[3]  Zhiyi Yu,et al.  A 167-Processor Computational Platform in 65 nm CMOS , 2009, IEEE Journal of Solid-State Circuits.

[4]  Gwan S. Choi,et al.  A High-Speed Fully-Programmable VLSI Decoder for Regular LDPC Codes , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[5]  Tinoosh Mohsenin,et al.  High-Throughput LDPC Decoders Using A Multiple Split-Row Method , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[6]  T. Mohsenin,et al.  A thresholding algorithm for improved Split-Row decoding of LDPC codes , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[7]  Sachin S. Sapatnekar,et al.  Routing Congestion in VLSI Circuits - Estimation and Optimization , 2007, Series on Integrated Circuits and Systems.

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

[9]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

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

[11]  Tinoosh Mohsenin,et al.  A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders , 2010, J. Signal Process. Syst..

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

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

[14]  E. Morifuji,et al.  Power Optimization for SRAM and Its Scaling , 2007, IEEE Transactions on Electron Devices.

[15]  An-Yeu Wu,et al.  A triple-mode LDPC decoder design for IEEE 802.11n SYSTEM , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[16]  Ning Chen,et al.  Memory Efficient Decoder Architectures for Quasi-Cyclic LDPC Codes , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[17]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[18]  E.M. Kurtas,et al.  The search for a practical iterative detector for magnetic recording , 2004, IEEE Transactions on Magnetics.

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

[20]  Tinoosh Mohsenin,et al.  An Improved Split-Row Threshold Decoding Algorithm for LDPC Codes , 2009, 2009 IEEE International Conference on Communications.

[21]  Frank R. Kschischang,et al.  Power Reduction Techniques for LDPC Decoders , 2008, IEEE Journal of Solid-State Circuits.

[22]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

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

[24]  Martin J. Wainwright,et al.  A 47 Gb/s LDPC decoder with improved low error rate performance , 2009, 2009 Symposium on VLSI Circuits.

[25]  Tinoosh Mohsenin,et al.  Trends and challenges in LDPC hardware decoders , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

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

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

[28]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[29]  C.-J. Richard Shi,et al.  Sliced Message Passing: High Throughput Overlapped Decoding of High-Rate Low-Density Parity-Check Codes , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

[31]  Tinoosh Mohsenin,et al.  Split-Row: A Reduced Complexity, High Throughput LDPC Decoder Architecture , 2006, 2006 International Conference on Computer Design.

[32]  Dawei Wang,et al.  Layered Approx-Regular LDPC: Code Construction and Encoder/Decoder Design , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.