On Implementation of Min-Sum Algorithm and Its Modifications for Decoding Low-Density Parity-Check (LDPC) Codes
Authors:
Top Cited Papers
- 2 May 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 53 (4) , 549-554
Abstract
The effects of clipping and quantization on the performance of the min-sum algorithm for the decoding of low-density parity-check (LDPC) codes at short and intermediate block lengths are studied. It is shown that in many cases, only four quantization bits suffice to obtain close to ideal performance over a wide range of signal-to-noise ratios. Moreover, we propose modifications to the min-sum algorithm that improve the performance by a few tenths of a decibel with just a small increase in decoding complexity. A quantized version of these modified algorithms is also studied. It is shown that, when optimized, modified quantized min-sum algorithms perform very close to, and in some cases even slightly outperform, the ideal belief-propagation algorithm at observed error rates.Keywords
This publication has 12 references indexed in Scilit:
- Density evolution for BP-based decoding algorithms of LDPC codes and their quantized versions2004
- Near optimal reduced-complexity decoding algorithms for LDPC codes2003
- A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution2002
- Efficient implementations of the sum-product algorithm for decoding LDPC codes2002
- Near optimum universal belief propagation based decoding of low-density parity check codesIEEE Transactions on Communications, 2002
- Density evolution for two improved BP-Based decoding algorithms of LDPC codesIEEE Communications Letters, 2002
- Reduced-complexity decoding algorithm for low-densityparity-check codesElectronics Letters, 2001
- Decoding low density parity check codes with finite quantization bitsIEEE Communications Letters, 2000
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962