English

应用科学学报 ›› 2010, Vol. 28 ›› Issue (1): 9-13.

• 通信工程 • 上一篇    下一篇

GF(q)域上LDPC码的改进扩展最小和译码算法

许拔1， 张仲明1， 何英亮2， 张尔扬1   

  1. 1. 国防科学技术大学电子科学与工程学院，长沙410073
    2. 湖南大学计算机与通信学院，长沙410082
  • 收稿日期:2009-09-21 修回日期:2009-11-29 出版日期:2010-01-20 发布日期:2010-01-20
  • 作者简介:许拔，博士生，研究方向：高效信道编码与高速数据传输，E-mail: nudtxb_0307@hotmail.com；张尔扬，教授，博导，研究方向：军用无线通信与网络技术、软件无线电、空间通信与组网，E-mail: zey407@nudt.edu.cn

Improved Extended Min-sum Decoding Algorithm of LDPC Codes over GF(q)

XU Ba1, ZHANG Zhong-ming1, HE Ying-liang2, ZHANG Er-yang1   

  1. 1. College of Electronics Science and Engineering, National University of Defense Technology,
    Changsha 410073, China
    2. College of Computer and Communication, Hunan University, Changsha 410082, China
  • Received:2009-09-21 Revised:2009-11-29 Online:2010-01-20 Published:2010-01-20

PDF

2155

被引次数

7

摘要：

通过分析扩展最小和算法(EMS)存在的问题，提出了一种针对q 元LDPC码的改进译码算法. 不同于EMS算法固定每次迭代中FHT的阶数，该算法根据每次迭代中变量节点的概率分布对的平均方差自适应选择FHT的阶数，并修改发生振荡的变量节点输出信息，使之同时包含上次迭代和当前迭代的信息，从而减少性能的损失与振荡的影响. 仿真结果表明，在译码复杂度相当的情况下，该算法性能与收敛速度明显优于EMS算法.

 

关键词: 低密度奇偶校验码, 和积算法, 快速哈达玛变换, 扩展最小和算法, 伽罗瓦域

Abstract:

To overcome the drawback of the extended min-sum algorithm (EMS), an improved EMS decoding algorithm is proposed, which is designed for LDPC over GF(q). The algorithm adaptively chooses the rank of FHT in each iteration step according to the average variance of bit nodes’ probability pairs. It differs from the original EMS algorithm in which the rank of FHT for each iteration step is a constant. Moreover, for oscillating variable nodes, the message of the previous iteration is added to the current message in the iterative procedure to reduce loss of performance and effects of oscillation. Experimental results show that the proposed algorithm can achieve better performance and converge faster than EMS with the same decoding complexity.

Key words: low density parity check codes, sum-product algorithm, fast Hadamard transform, extended minsum algorithm(EMS), Galois field

中图分类号: