摘要
本文以Tanner图上的迭代消息流传递技术为基础,分析了Gallager提出的LDPC码第一解码方案,给出基于校验和的位翻转硬判决解码算法。在此基础上引入接收信号作为可靠性评估,使评估值作为硬判决的加权系数,从而提出基于校验和的加权位翻转解码算法。加权位翻转算法充分考虑了接收符号的信息;为了快速搜索翻转位,对不满足的校验方程数采用最大投票数排队算法。这些措施的合理应用改善了基于校验和的位翻转解码算法的性能。
This paper analyzes the first decoding scheme of LDPC codes created by Gallager, by means of the iterative message-passing technique on Tanner graph, and gives a bit-flipping hard-decision decoding algorithm based on check sum. Then it introduces receiving signal as reliability evaluate or weighted coefficient of hard-decision, consequently presents weighted bit-flipping decoding algorithm based on check sum. The weighted bit-flipping decoding algorithm adequately considers received symbol information. A 'maximum votes queue' algorithm for the numbers of which the parity-check functions were not satisfied was applied to quickly search the flipping bit. Approaches above all were used to improve bit-flipping algorithm based on parity-check sum.
出处
《信号处理》
CSCD
2004年第5期494-496,460,共4页
Journal of Signal Processing
基金
国家自然科学基金资助项目(60372067)
