Adaptive offset min-sum algorithm for low-density parity check codes

IEEE Communications Letters

Volumn 10, Issue 6, 2006, Pages 483-485

  Jiang, Ming ^a   Zhao, Chunming ^a   Zhang, Li ^a   Xu, Enyang ^a  

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

Iterative decoding; LDPC codes; Normalized offset min sum algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DECODING; OPTIMIZATION;

ADAPTIVE OFFSET; ITERATIVE DECODING; LOW-DENSITY PARITY CHECK CODES (LDPC); MIN-SUM ALGORITHM; OPTIMAL CORRECTION FACTOR;

CODES (SYMBOLS);

EID: 33745289035     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2006.1638623     Document Type: Article

References (13)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay and R. M. Neal, "Near shannon limit performance of low-density parity-check codes," Electron. Lett., vol. 32, no. 18, pp. 1645-1646, Aug. 1996.
3. M. P. C. Fossorier, M. Mihaljevic, and H. Imai, "Reduced complexity iterative decoding of low density parity check codes based on belief propagation," IEEE Trans. Commun., vol. 47, no. 5, pp. 673-680, May 1999.
4. E. Eleftheriou, T. Mittelholzer, and A. Dholakia, "Reduced-complexity decoding algorithm for low-density parity-check codes," Electron. Lett., vol. 37, no. 2, pp. 102-104, Jan. 2001.
5. A. Anastasopoulos, "A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution," in Proc. IEEE Globecom, vol. 2, San Antonio,TX, Nov. 2001, pp. 1021-1025.
6. G. Richter, G. Schmidt, M. Bossert, and E. Costa, "Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution," in ICC05, vol. 1, Seoul, Korea, May 2005, pp. 642-646.
7. J. Zhao, F. Zarkeshvari, and A. H. Banihashemi, "On implementation of min-sum alogorithm and its modifications for decoding low-dendity parity-check (LDPC) codes," IEEE Trans. Commun., vol. 53, no. 4, pp. 549-554, Apr. 2005.
8. S. L. Howard, C. Schlegel, and V. C. Gaudet, "A degree-matched check node approximation for LDPC decoding," in Proc. IEEE Int. Symp. on Information Theory, vol. 4-9, Adelaide, Australia, Nov. 2005, pp. 1131-1135.
9. J. Chen and M. P. C. Fossorier, "Near-optimum universal belief propagation based decoding of low-density parity check codes," IEEE Trans. Commun., vol. 50, no. 3, pp. 406-414, Mar. 2002.
10. J. Chen, A. Dholakia, E. Eleftheriou, M. P. C. Fossorier, and X.-Y. Hu, "Reduced-complexity decoding of LDPC codes," IEEE Trans. Commun., vol. 53, no. 8, pp. 1288-1299, Aug. 2005.
11. J. Zhang, M. Fossorier, D. Gu, and J. Zhang, "Improved min-sum decoding of LDPC codes using 2-dimensional normalization," in Proc. IEEE Globecom, vol. 3, St Louis, MO, Nov. 2005, pp. 1187-1192.
12. J. Chen and M. P. C. Fossorier, "Density evolution for two improved BP-based decoding algorithms of LDPC codes," IEEE Commun. Lett., vol. 6, no. 5, pp. 208-210, May 2002.
13. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 617-637, Feb. 2001.