A Threshold-Based Min-Sum Algorithm to Lower the Error Floors of Quantized LDPC Decoders
- 27 January 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 68 (4) , 2005-2015
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (ECCS-1710920, OIA-1757207)
This publication has 38 references indexed in Scilit:
- On Characterization of Elementary Trapping Sets of Variable-Regular LDPC CodesIEEE Transactions on Information Theory, 2014
- Reduced-Complexity Min-Sum Algorithm for Decoding LDPC Codes With Low Error-FloorIEEE Transactions on Circuits and Systems I: Regular Papers, 2014
- Two-dimensional correction for min-sum decoding of irregular LDPC codesIEEE Communications Letters, 2006
- Reduced-Complexity Decoding of LDPC CodesIEEE Transactions on Communications, 2005
- On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) CodesIEEE Transactions on Communications, 2005
- LDPC Block and Convolutional Codes Based on Circulant MatricesIEEE Transactions on Information Theory, 2004
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999
- Time-varying periodic convolutional codes with low-density parity-check matrixIEEE Transactions on Information Theory, 1999
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962