摘要
通过对LDPC码的RBP和NWRBP译码算法进行研究,针对算法在译码过程中运算量过大,不利于在硬件上实现的问题,提出一种改进型的RBP和NWRBP译码算法。该算法在更新从检验节点到变量节点的信息时,采用最小和算法得出近似值,以此降低译码复杂度。同时,为了弥补近似值所带来的译码性能损失,引入乘性修正因子和加性修正因子来提高译码性能。
The residual belief-propagation(RBP)and node-wise residual belief-propagation(NWRBP)decoding algorithm for low-density parity-check(LDPC)codes is researched,but it has excessive computing amount in decoding process,and is difficult to implement with hardware.Therefore,the improved RBP and NWRBP decoding algorithm are proposed.When the algorithm is used to update the information from check nodes to variable nodes,the Min-Sum(MS)algorithm is adopted to obtain the approximate value,so as to reduce the complexity of decoding.In the meanwhile,in order to compensate for the decoding performance loss caused by the approximate value,the multiplicative correction factor and additive correction factor are introduced to improve the decoding performance successfully.
作者
周华
赵良
李诚谦
ZHOU Hua;ZHAO Liang;LI Chengqian(School of Electronic and Information Engineering,Nanjing University of Information Science and Technology,Nanjing 210044,China;Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology,Nanjing 210044,China;Jiangsu Key Laboratory of Meteorological Observation and Information Processing,Nanjing 210044,China)
出处
《现代电子技术》
北大核心
2019年第11期15-18,23,共5页
Modern Electronics Technique
基金
国家自然科学基金(61401216)
江苏高校优势学科Ⅱ期建设工程资助项目~~
关键词
LDPC码
RBP算法
NWRBP算法
最小和算法
修正因子引入
信息更新
low-density parity-check code
residual belief-propagation algorithm
node-wise residual belief-propagation algorithm
Min-Sum algorithm
correction factor introduction
information updating
