Computationally-efficient iterative decoding for storage system design: Min-Sum refined

In this paper we propose a computationally-efficient, iterative decoding algorithm that is well-suited for storage systems with very stringent reliability constraints and low redundancy/high code rate requirements. The proposed Dual-Scaling Min-Sum (DS-MSA) overcomes certain deficiencies of the Min-Sum approximation when used for decoding graph-based codes. We observe that a small but non-negligible fraction of check-to-variable messages is underestimated by the Normalized Min-Sum algorithm in the low error rate region. By carefully adjusting the scaling factor for the variable-to-check message with the smallest magnitude, we develop the DS-MSA algorithm characterized by two scaling parameters. The proposed algorithm (1) outperforms Sum-Product and (Normalized) Min-Sum algorithms in the very low error rate regime, (2) maintains the low-complexity feature of the Min-Sum, and (3) can be easily combined with existing decoder implementations.

[1]  Lara Dolecek,et al.  Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices , 2009, IEEE Transactions on Communications.

[2]  Valentin Savin,et al.  Self-corrected Min-Sum decoding of LDPC codes , 2008, 2008 IEEE International Symposium on Information Theory.

[3]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

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

[5]  V. Anantharam,et al.  Design of LDPC Decoders for Low Error Rate Performance , 2008 .

[6]  Chih-Wei Liu,et al.  A dynamic normalization technique for decoding LDPC codes , 2005, IEEE Workshop on Signal Processing Systems Design and Implementation, 2005..

[7]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.

[8]  Marc P. C. Fossorier,et al.  Improved min-sum decoding of LDPC codes using 2-dimensional normalization , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[9]  Marc P. C. Fossorier,et al.  Two-dimensional correction for min-sum decoding of irregular LDPC codes , 2006, IEEE Communications Letters.

[10]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[11]  Zhongfeng Wang,et al.  Area-efficient parallel decoder architecture for high rate QC-LDPC codes , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[12]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[13]  Ming Jiang,et al.  Adaptive offset min-sum algorithm for low-density parity check codes , 2006, IEEE Communications Letters.

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

[15]  Naresh R. Shanbhag,et al.  Turbo decoder architectures for low-density parity-check codes , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[16]  Vincent C. Gaudet,et al.  A degree-matched check node approximation for LDPC decoding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..