论文信息 - Adaptive-Normalized/Offset Min-Sum Algorithm

Adaptive-Normalized/Offset Min-Sum Algorithm

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.

Ming Jiang | Chunming Zhao | Xiaofu Wu | Yue Song

[1] Yu Kou,et al. Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More , 1999 .

[2] Jinghu Chen,et al. Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.

[3] Hideki Imai,et al. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation , 1999, IEEE Trans. Commun..

[4] Amir H. Banihashemi,et al. Improving belief propagation on graphs with cycles , 2004, IEEE Communications Letters.

[5] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[6] Jinghu Chen,et al. Near optimum universal belief propagation based decoding of low-density parity check codes , 2002, IEEE Trans. Commun..