Adaptive-Normalized/Offset Min-Sum Algorithm
Authors:
- 9 August 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 14 (7) , 667-669
Abstract
An adaptive-normalized/offset min-sum (AN-/AO-MS) algorithm for decoding low-density parity-check (LDPC) codes is proposed. Unlike the normalized/offset min-sum (NMS/OMS) algorithm, the normalization/offset factor is adaptively adjusted according to the state of check nodes in each iteration. Simulation results show that the proposed AN-/AO-MS algorithm can perform better than the NMS/OMS algorithm while still preserving the low complexity of the min-sum algorithm.Keywords
This publication has 5 references indexed in Scilit:
- Improving Belief Propagation on Graphs With CyclesIEEE Communications Letters, 2004
- 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
- Low-density parity-check codes based on finite geometries: a rediscovery and new resultsIEEE Transactions on Information Theory, 2001
- Reduced complexity iterative decoding of low-density parity check codes based on belief propagationIEEE Transactions on Communications, 1999