摘要
为了优化LDPC迭代译码性能和降低算法复杂度,提出了一种改进的基于Gallager A算法的2b离散字母表迭代译码算法。在每一轮迭代中,Tanner图上的校验节点与变量节点之间所传递的消息有1b表示符号值,另1b反映码字结构特性,其中变量节点更新规则是通过查表法来实现的。在二元对称信道下针对列重为3的规则LDPC码做了仿真实验,仿真结果表明该算法性能明显优于原算法,并且具有较低的复杂度。
To optimize the performance of iterative decoding for LDPC code and reduce the complexity of algorithms,a novel 2-bit discrete alphabet iterative decoding algorithm based on Gallager A algorithm is presented in this paper.In every iteration,messages transmitted between check nodes and variable nodes in Tanner graph has two bits: one denotes the value of message and another indicates the characteristic of codeword,in which the update rules for variable nodes are realized by the look-up map table(LUMT).A simulation experiment for 3-left-regular LDPC codes on binary symmetric channel(BSC) was conducted.The simulation results show that the performance of the proposed algorithm with lower computational complexity is more significant than that of the original algorithm.
出处
《现代电子技术》
2012年第4期4-6,共3页
Modern Electronics Technique
基金
教育部特色专业建设点项目(TS11772)
陕西省教育科学"十一五"规划2010年立项课题(SGH10154)
