Majority-Based Tracking Forecast Memories for Stochastic LDPC Decoding
Authors:
Top Cited Papers
- 1 June 2010
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 58 (9) , 4883-4896
Abstract
This paper proposes majority-based tracking forecast memories (MTFMs) for area efficient high throughput ASIC implementation of stochastic Low-Density Parity-Check (LDPC) decoders. The proposed method is applied for ASIC implementation of a fully parallel stochastic decoder that decodes the (2048, 1723) LDPC code from the IEEE 802.3an (10GBASE-T) standard. The decoder occupies a silicon core area of 6.38 mm2 in CMOS 90 nm technology, achieves a maximum clock frequency of 500 MHz, and provides a maximum core throughput of 61.3 Gb/s. The decoder also has good decoding performance and error-floor behavior and provides a bit error rate (BER) of about 4 × 10-13 at Eb/N0=5.15 dB. To the best of our knowledge, the implemented decoder is the most area efficient fully parallel soft -decision LDPC decoder reported in the literature.Keywords
This publication has 28 references indexed in Scilit:
- A Low-Complexity Message-Passing Algorithm for Reduced Routing Congestion in LDPC DecodersIEEE Transactions on Circuits and Systems I: Regular Papers, 2010
- Fully Parallel Stochastic LDPC DecodersIEEE Transactions on Signal Processing, 2008
- Gear-shift decodingIEEE Transactions on Communications, 2006
- Stochastic iterative decoders2005
- Iterative decoding using stochastic computationElectronics Letters, 2003
- A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoderIEEE Journal of Solid-State Circuits, 2002
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1996
- Stochastic Computing Systems1969