计算机工程 ›› 2008, Vol. 34 ›› Issue (14): 9-11.doi: 10.3969/j.issn.1000-3428.2008.14.004

• 博士论文 • 上一篇    下一篇

一种用于规则QC-LDPC码的高效译码方法

赵 岭1,张晓林1,朱曼洁2   

  1. (1. 北京航空航天大学电子信息工程学院,北京 100083;2. 中国空间技术研究院卫星应用系统部,北京 100083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-07-20 发布日期:2008-07-20

Efficient Decoding Method for Regular QC-LDPC Codes

ZHAO Ling1, ZHANG Xiao-lin1, ZHU Man-jie2   

  1. (1. School of Electronics and Information Engeering, Beijing Univ. of Aeronautics and Astronautics, Beijing 100083;2. Satellite Application System Department, China Academy of Space Technology, Beijing 100083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-07-20 Published:2008-07-20

摘要: 针对一类规则QC-LDPC码,提出一种高效的Log-BP译码方法,通过矩阵分裂,将原监督矩阵分裂成多个小矩阵,将原本的校验节点更新运算拆分成多次处理,以降低log-BP迭代运算的复杂度,给出该方法的迭代运算顺序。与现有的log-BP译码方法相比,该方法在相同的码速率下,校验节点运算单元与变量节点运算单元总规模减小了1/3;在相同的硬件资源下,译码速率提高了1/3,且校验节点运算单元与变量节点运算单元结构趋于对称,有利于设置更少的流水线级数、获得更好的时钟性能。

关键词: QC-LDPC码, log-BP算法, 矩阵分裂

Abstract: This paper presents a decoding method for regular QC-LDPC codes. In this method, the original check matrix is split into several smaller ones, thus CNU is decomposed into multiple parallel units, which results in great hardware resource reduction. A novel iterative sequence is presented. Compared with the traditional log-BP decode method, the method can reduce the whole logic core size of CNU and VNU by 1/3 under the same bit-rate, and it can improve bit-rate by 1/3 under the same logic core size in the condition of the original check matrix split into two parts.

Key words: QC-LDPC codes, log-BP algorithm, matrix split

中图分类号: