用于LDPC码快速译码的改进加权比特翻转算法  

An Improved Weighted Bit-Flipping Algorithm for High-Speed LDPC Decoding

作　　者：马克祥 孙吉成[1] 胡建华[1] 张海林[1] 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,西安710071

出　　处：《北京邮电大学学报》2014年第2期109-112,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：高等学校学科创新引智计划资助项目(B08038);西安电子科技大学自主科研项目(72001859)

摘　　要：为了提高低密度奇偶校验码(LDPC)译码器的译码速度,提出了一种基于部分并行比特选择机制的快速多比特翻转算法.根据接收向量中错误具有随机分布的特点,将所有比特划分成若干子块,从每个子块挑选出1个候选翻转比特,再从这些候选比特中挑选出合理数目的比特进行翻转,完成译码迭代.此外,通过引入树形搜索和数据池技术降低该算法核心模块的计算复杂度,以进一步增加算法硬件实现时的译码速度.分析结果表明,相较于多比特翻转算法,利用所提出的算法和相关硬件实现技术,译码器的吞吐量能得到明显的提高.仿真结果验证了快速多比特翻转算法的有效性.In order to improve the decoding speed of low density parity check code （LDPC） codes, a fast weighted bit flipping algorithm with partially parallel bit-chosen is proposed. In this scheme, all bits are firstly divided into several blocks according to the stochastic error distribution in the received vector. And then one bit is chosen from each block to form the candidate set of flipped bits. Finally, a proper number of bits are chosen from the candidate set and flipped to implement the decoding. Furthermore, the tree sorting and data pool methods are adopted to decrease the computational complexity of the key module of the proposed algorithm. Compared with the muhi-bit flippin （MBF） algorithm by simulations, the proposed scheme and the method of hardware implement can achieve significant improvement in the decoding speed.

关 键 词：低密度奇偶校验码 加权比特翻转算法 树形搜索 部分并行 

分 类 号：TN911.22[电子电信—通信与信息系统]