中国邮电高校学报(英文) ›› 2010, Vol. 17 ›› Issue (4): 1-5.doi: 10.1016/S1005-8885(09)60479-9

• Wireless •    下一篇

Novel modified min-sum decoding algorithm for low-density parity-check codes

刘海洋 曲文泽 刘彬 李江鹏 罗士栋 陈杰   

  1. 中国科学院微电子研究所
  • 收稿日期:2009-04-27 修回日期:2010-05-09 出版日期:2010-08-30 发布日期:2010-08-31
  • 通讯作者: 刘海洋 E-mail:liuhaiyang@ime.ac.cn
  • 基金资助:

    This work was supported by the Major State Basic Research Development Program of China (2009CB320300).

Novel modified min-sum decoding algorithm for low-density parity-check codes

  1. Institute of Microelectronics, Chinese Academy of Sciences, Beijing 100029, China
  • Received:2009-04-27 Revised:2010-05-09 Online:2010-08-30 Published:2010-08-31
  • Supported by:

    This work was supported by the Major State Basic Research Development Program of China (2009CB320300).

摘要:

The problem of improving the performance of min-sum decoding of low-density parity-check (LDPC) codes is considered in this paper. Based on min-sum algorithm, a novel modified min-sum decoding algorithm for LDPC codes is proposed. The proposed algorithm modifies the variable node message in the iteration process by averaging the new message and previous message if their signs are different. Compared with the standard min-sum algorithm, the modification is achieved with only a small increase in complexity, but significantly improves decoding performance for both regular and irregular LDPC codes. Simulation results show that the performance of our modified decoding algorithm is very close to that of the standard sum-product algorithm for moderate length LDPC codes.

关键词:

LDPC codes, sum-product algorithm, min-sum algorithm, modified min-sum algorithm

Abstract:

The problem of improving the performance of min-sum decoding of low-density parity-check (LDPC) codes is considered in this paper. Based on min-sum algorithm, a novel modified min-sum decoding algorithm for LDPC codes is proposed. The proposed algorithm modifies the variable node message in the iteration process by averaging the new message and previous message if their signs are different. Compared with the standard min-sum algorithm, the modification is achieved with only a small increase in complexity, but significantly improves decoding performance for both regular and irregular LDPC codes. Simulation results show that the performance of our modified decoding algorithm is very close to that of the standard sum-product algorithm for moderate length LDPC codes.

Key words:

LDPC codes, sum-product algorithm, min-sum algorithm, modified min-sum algorithm