基于串行消息传递机制的QC-LDPC码快速译码算法研究

雷菁; 高永强; 王建辉; 贺文辉

doi:10.3724/SP.J.1146.2008.00137

基于串行消息传递机制的QC-LDPC码快速译码算法研究

doi: 10.3724/SP.J.1146.2008.00137

雷菁^{① 高永强,},
高永强,
王建辉,
贺文辉

基金项目:

国家自然科学基金(60572176)资助项目

计量
- 文章访问数: 3604
- HTML全文浏览量: 143
- PDF下载量: 1227
- 被引次数: 0
出版历程
- 收稿日期: 2008-01-25
- 修回日期: 2008-07-11
- 刊出日期: 2008-12-19

Research on a Fast Decoding Method of the Quasi-cyclic LDPC Codes Based on Serial Message-Passing Schedule

摘要

摘要: 针对准循环LDPC(QC-LDPC)码基于洪水消息传递机制译码算法的不足，该文提出了一种快速的分组串行译码算法。该算法通过将LDPC码的校验节点(或变量节点)按一定规则划分成若干个子集，在每一轮迭代过程中，依次对各个子集中的校验节点(或变量节点)并行地进行消息更新，提高了译码速度。同时根据分组规则，提出了一种有效的分组方法，并通过分析发现基于循环置换阵的准循环LDPC码非常适合采用这种分组译码算法进行译码。通过对不同消息传递机制下准循环LDPC码译码算法性能的仿真比较，验证了在复杂度不增加的情况下，该译码算法在继承了串行译码算法性能优异和迭代收敛快等优点的同时，极大地提高了准循环LDPC码的译码速度。分析表明，分组串行译码算法译码速度至少为串行译码算法的p倍(p为准循环LDPC码校验矩阵中循环置换阵的行数或列数)。
- 准循环LDPC码 /
- 译码算法 /
- 串行消息传递机制 /
- 分组串行算法
Abstract: A new fast decoding method of Quasi-Cyclic LDPC(QC-LDPC)codes, named semi-serial decoding algorithm, is presented through contraposing the shortcoming of flood decoding method.For the algorithm, the message was updated in a serial sequence of m subsets of check nodes(or variable nodes), while the check nodes(or variable nodes) in the same subset are updated simultaneously. In this way,the decoding speed would be faster than the common serial decoding algorithm several times. An efficient grouping method suitable for the quasi-cyclic LDPC codes based on the circulant architecture is proposed.Simulation results show that,under the same complexiry,the proposed algorithm fastens the decoding speed of quasi-cyclic LDPC codes, meanwhile, it inherits all the merits of the serial massage-passing decoding algorithm. The conclusion is that the speed of the semi-serial decoding method is at least p times than that of the serial one(p is the number of rows of the cyclic permutation matrix in the parity check matrix of quasi-cyclic LDPC codes).
- Q /
- C /
- -

HTML全文

参考文献(1)

[1] Radosavljevic P, de Baynast A, and Cavallaro J R.Optimized message passing schedules for LDPC decoding.Conference record of the 39th asilomar conference onsignals,systems and copmputers, California, 2005: 591-595. [2] Mao Y and Banihashemi A H. A new schedule for decodinglow-density parity-check codes. Global TelecommunicationsConference, USA, 2001, 47(2): 1007-1010. [3] Kschischang F R, Frey B J, and Loeliger H A. Factor graphsand the sum-product algorithm[J].IEEE Trans. on Info. Theory.2001, 47(2):498-519 [4] Zhang T and Fossorrier M. Shuffled belief propagationdecoding. The Proceedings 36th Asilomar Conference onSignal Systems and Computers, Pacific Grove, Grove, USA,2002: 8-15. [5] Zhao Chuan-gang, Yuan Jin-sheng, Lin Xue-hong, and LinJia-ru. Improvement of shuffled iterative decoding.Proceedings of 2006 IEEE Information Theory Workshop,Uruguay, 2006: 114-116. [6] Sharon E, Litsyn S, and Goldberger J. An efficient messagepassingschedule for LDPC decoding. Proc. 23rd IEEE Conv.,Israel, 2004: 223-226. [7] Sharon E, Litsyn S, and Goldberger J. Convergence analysisof serial message-passing schedules for LDPC decoding. The4th International Symposium on Turbo Codes, Munich, 2006:110-116. [8] 雷菁, 文磊, 唐朝京. 基于变量结点串行消息传递的LDPC 码译码研究. 国防科技大学学报, 2006, 28(5): 52-57. [9] Fossorier M P C. Quasi-cyclic low-density parity-check codesfrom circulant permutation matrices[J].IEEE Trans. on Info.Theory.2004, 50(8):1788-1793 [10] Xu Jun, Chen Lei, Lan Lan, and Lin Shu. Constuction of lowdensityparity-check codes by superposition. IEEE Trans. onInf. Theory, 2005, 53(2): 243-251. [11] Li Zongwang and Kumar B V K V. A class of good quasicycliclow-density parity check codes based on progressiveedge growth graph Conference record of the 38th asilomarconference on signals, systems and copmputers, California,2004: 1990-1994. [12] Richardson T and Urbanke R L. The capacity of low-densitypatiry-check codes under message-passing decoding[J].IEEETrans. on Inf. Theory.2001, 47(1):599-618

施引文献

资源附件(0)

访问统计