首页 | 本学科首页   官方微博 | 高级检索  
     

GF(q)域上LDPC码的改进扩展最小和译码算法
引用本文:许拔,张仲明,何英亮,张尔扬. GF(q)域上LDPC码的改进扩展最小和译码算法[J]. 应用科学学报, 2010, 28(1): 9-13
作者姓名:许拔  张仲明  何英亮  张尔扬
作者单位:1. 国防科学技术大学电子科学与工程学院,长沙4100732. 湖南大学计算机与通信学院,长沙410082
摘    要:通过分析扩展最小和算法(EMS)存在的问题,提出了一种针对q 元LDPC码的改进译码算法. 不同于EMS算法固定每次迭代中FHT的阶数,该算法根据每次迭代中变量节点的概率分布对的平均方差自适应选择FHT的阶数,并修改发生振荡的变量节点输出信息,使之同时包含上次迭代和当前迭代的信息,从而减少性能的损失与振荡的影响. 仿真结果表明,在译码复杂度相当的情况下,该算法性能与收敛速度明显优于EMS算法.

关 键 词:低密度奇偶校验码  和积算法  快速哈达玛变换  扩展最小和算法  伽罗瓦域  
收稿时间:2009-09-21
修稿时间:2009-11-29

Improved Extended Min-sum Decoding Algorithm of LDPC Codes over GF(q)
XU Ba,ZHANG Zhong-ming,HE Ying-liang,ZHANG Er-yang. Improved Extended Min-sum Decoding Algorithm of LDPC Codes over GF(q)[J]. Journal of Applied Sciences, 2010, 28(1): 9-13
Authors:XU Ba  ZHANG Zhong-ming  HE Ying-liang  ZHANG Er-yang
Affiliation: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
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 it...
Keywords:low density parity check cedes  sum-product algorithm  fast Hadamard transform  extended min-sum algorithm(EMS)  Galois field
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《应用科学学报》浏览原始摘要信息
点击此处可从《应用科学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号