Strategies for Reducing Decoding Cycles in Stochastic LDPC Decoders
Authors:
- 25 February 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 63 (9) , 873-877
Abstract
This brief presents three strategies, including initialization based on Look Up Table (LUT), postprocessing based on bit flipping and hard decision based on the posterior information, to reduce the number of decoding cycles (DCs) for stochastic low-density parity-check decoding. For the standard IEEE 802.3an code, simulation indicates a 73.6% reduction in the average number of DCs with a satisfactory bit error rate. Moreover, hardware implementation shows that the area required for the proposed decoder is significantly reduced.Keywords
Funding Information
- National Natural Science Foundation of China (61306043, 61234002)
- Shanghai natural science (13ZR1401800)
- National Science and Technology Major Project of China (2011ZX 03003-003-03)
- Ministry of Science and Technology of Taiwan (MOST 103-2622-E-007 -029 -CC2)
This publication has 11 references indexed in Scilit:
- FPGA implementation of a clockless stochastic LDPC decoder2014
- A Fully Parallel LDPC Decoder Architecture Using Probabilistic Min-Sum Algorithm for High-Throughput ApplicationsIEEE Transactions on Circuits and Systems I: Regular Papers, 2014
- Controlled start-up stochastic decoding of LDPC codes2013
- Delayed Stochastic Decoding of LDPC CodesIEEE Transactions on Signal Processing, 2011
- Majority-Based Tracking Forecast Memories for Stochastic LDPC DecodingIEEE Transactions on Signal Processing, 2010
- Fully Parallel Stochastic LDPC DecodersIEEE Transactions on Signal Processing, 2008
- Survey of Stochastic Computation on Factor Graphs37th International Symposium on Multiple-Valued Logic (SMVLL'07), 2007
- Iterative decoding using stochastic computationElectronics Letters, 2003
- 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