A 588-Gb/s LDPC Decoder Based on Finite-Alphabet Message Passing

An ultrahigh throughput low-density parity-check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to previously reported LDPC decoders in the literature. The decoder benefits from a serial message-transfer approach between the decoding stages to alleviate the well-known routing congestion problem in parallel LDPC decoders. Furthermore, a finite-alphabet message passing algorithm is employed to replace the VN update rule of the standard min-sum (MS) decoder with lookup tables, which are designed in a way that maximizes the mutual information between decoding messages. The proposed algorithm results in an architecture with reduced bit-width messages, leading to a significantly higher decoding throughput and to a lower area compared to an MS decoder when serial message transfer is used. The architecture is placed and routed for the standard MS reference decoder and for the proposed finite-alphabet decoder using a custom pseudo-hierarchical backend design strategy to further alleviate routing congestions and to handle the large design. Postlayout results show that the finite-alphabet decoder with the serial message-transfer architecture achieves a throughput as large as 588 Gb/s with an area of 16.2 mm2 and dissipates an average power of 22.7 pJ per decoded bit in a 28-nm fully depleted silicon on isulator library. Compared to the reference MS decoder, this corresponds to 3.1 times smaller area and 2 times better energy efficiency.

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

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

[3]  David Declercq,et al.  Finite Alphabet Iterative Decoders—Part I: Decoding Beyond Belief Propagation on the Binary Symmetric Channel , 2013, IEEE Transactions on Communications.

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

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

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

[7]  Shie Mannor,et al.  High-Throughput Energy-Efficient LDPC Decoders Using Differential Binary Message Passing , 2014, IEEE Transactions on Signal Processing.

[8]  Hubert Kaeslin,et al.  Digital Integrated Circuit Design: From VLSI Architectures to CMOS Fabrication , 2008 .

[9]  Alan N. Willson,et al.  A flexible decoder IC for WiMAX QC-LDPC codes , 2008, 2008 IEEE Custom Integrated Circuits Conference.

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

[11]  Huang-Chang Lee,et al.  A Fully Parallel LDPC Decoder Architecture Using Probabilistic Min-Sum Algorithm for High-Throughput Applications , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.

[12]  Peter Andrekson,et al.  Low-Power 400-Gbps Soft-Decision LDPC FEC for Optical Transport Networks , 2016, Journal of Lightwave Technology.

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

[14]  Mohamad Sawan,et al.  Delayed Stochastic Decoding of LDPC Codes , 2011, IEEE Transactions on Signal Processing.

[15]  Gerald Matz,et al.  A fully-unrolled LDPC decoder based on quantized message passing , 2015, 2015 IEEE Workshop on Signal Processing Systems (SiPS).

[16]  Gerald Matz,et al.  Quantized message passing for LDPC codes , 2015, 2015 49th Asilomar Conference on Signals, Systems and Computers.

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

[18]  Brian M. Kurkoski,et al.  Noise Thresholds for Discrete LDPC Decoding Mappings , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[19]  Norbert Wehn,et al.  A new dimension of parallelism in ultra high throughput LDPC decoding , 2013, SiPS 2013 Proceedings.

[20]  Yusuf Leblebici,et al.  A 5.35 mm 2 10GBASE-T Ethernet LDPC decoder chip in 90 nm CMOS , 2010 .

[21]  A. Burg,et al.  A 15.8 pJ/bit/iter quasi-cyclic LDPC decoder for IEEE 802.11n in 90 nm CMOS , 2010, 2010 IEEE Asian Solid-State Circuits Conference.

[22]  Javier Valls-Coquillat,et al.  Reduced-Complexity Min-Sum Algorithm for Decoding LDPC Codes With Low Error-Floor , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.

[23]  Amir H. Banihashemi,et al.  A Differential Binary Message-Passing LDPC Decoder , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

[25]  Yusuf Leblebici,et al.  A 5.35 mm2 10GBASE-T Ethernet LDPC decoder chip in 90 nm CMOS , 2010, 2010 IEEE Asian Solid-State Circuits Conference.

[26]  Vincent C. Gaudet,et al.  Design of High-Throughput Fully Parallel LDPC Decoders Based on Wire Partitioning , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[27]  Brian M. Kurkoski,et al.  Decoding LDPC codes with mutual information-maximizing lookup tables , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[28]  Frank R. Kschischang,et al.  A 3.3-Gbps bit-serial block-interlaced min-sum LDPC decoder in 0.13-μm CMOS , 2007, 2007 IEEE Custom Integrated Circuits Conference.