Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
Hi-index | 0.00 |
An adaptive-normalized/offset min-sum (AN-/AOMS) 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-/AOMS algorithm can perform better than the NMS/OMS algorithm while stilI preserving the low complexity of the min-sum algorithm.