基于原型图的低码率LDPC码最小和译码算法改进方案

姜明; 王晨

doi:10.3724/SP.J.1146.2009.01652

基于原型图的低码率LDPC码最小和译码算法改进方案

doi: 10.3724/SP.J.1146.2009.01652

姜明,
王晨

基金项目:

国家自然科学基金(60802007)，东南大学移动通信国家重点实验室自主研究项目(2008A10)和国家863计划项目(2009AA01Z235)资助课题

计量
- 文章访问数: 4331
- HTML全文浏览量: 112
- PDF下载量: 934
- 被引次数: 0
出版历程
- 收稿日期: 2009-12-31
- 修回日期: 2010-05-07
- 刊出日期: 2010-11-19

An Improvement on the Min-sum Algorithm for Low-rate Protograph LDPC Codes

摘要

摘要: 低密度奇偶校验(LDPC)码的译码硬件实现方案大多采用计算复杂度较低的修正最小和(NMS)算法，然而对于低码率LDPC码，由于校验节点度数低，NMS算法的修正误差较大，导致其译码性能和标准的置信传播(BP)算法相比有较大差异。该文针对基于原图构造的一类低码率LDPC码，提出了在NMS迭代译码中结合震荡抵消(OSC)处理和多系数(MF)修正技术的方案。结合低码率原型图LDPC码行重分布差异较大的特点，MF修正算法可以有效地减少计算误差，从而改善译码性能。另外低码率原型图LDPC码的收敛较慢，而OSC处理则可以较好地抑制正反馈信息，进一步提高NMS算法的性能增益。仿真结果表明，对于此类低码率LDPC码， MF-OSC-NMS算法可以达到接近BP算法的性能。OSC处理和MF修正技术硬件实现简单，与NMS算法相比几乎没有增加计算复杂度，因此MF-OSC-NMS算法是译码算法复杂度和性能之间一个较好的折中处理方案。
- 低密度奇偶校验码 /
- 原型图 /
- 最小和算法
Abstract: The Normalized Min-Sum (NMS) algorithm can be implemented with low complexity and is widely used in the LDPC decoders, but there is a significant performance gap between the Belief Propagation (BP) algorithm and NMS algorithm for low-rate LDPC codes due to the inaccurate approximations of the check-nodes with low weight. In this paper, an improved NMS algorithm combined with the Oscillation (OSC) correction of bit-node updating and Multiple Factors (MF) modification of check-node updating is proposed. Although the row weights of the low-rate protograph LDPC codes may vary considerably, the error of the approximation in check-node updating can be effectively reduced by MF modification. Moreover, the OSC correction can reduce the positive feedback and achieve furthermore improvement on the decoding performance of low-rate protograph LDPC codes, where the decoding convergence is slow. Simulation results show that the OSC-MF-NMS algorithm can obtain a noticeable performance gain in decoding of low-rate protograph LDPC codes. The complexity of the OSC and MF process is quite low, so the proposed algorithm is a good trade-off between the decoding complexity and error performance.
- LDPC codes /
- Protograph /
- Min-Sum (MS) algorithm

HTML全文

参考文献(1)

Gallager R G. Low-density parity-check codes [J].IRE Transactions on Information Theory.1962, 8(1):21-28[2]Chung S Y. On the construction of some capacity- approaching coding schemes [D]. [Ph.D. dissertation], MIT, Cambridge, MA, 2000.[3]Brink S ten. Convergence behavior of iteratively decoded parallel concatenated codes [J].IEEE Transactions on Communications.2001, 49(10):1727-1737[4]Qian D, Jiang M, and Zhao C, et al.. A modification to weighted bit-flipping decoding algorithm for LDPC codes based on reliability adjustment [C]. IEEE International Conference, Beijing, 2008: 1161-1165.[5]Mobini N, Banihashemi A H, and Hemati S. A differential binary message-passing LDPC decoder [J].IEEE Transactions on Communications.2009, 57(9):2518-2523[6]Kim S, Jang M H, and No J S, et al.. Sequential message- passing decoding of LDPC codes by partitioning check nodes [J].IEEE Transactions on Communications.2008, 56(7):1025-1031[7]Chang Y M, Andres I, and Casado V. Lower-complexity layered belief-propagation decoding of LDPC codes [C]. IEEE International Conference, Beijing, 2008: 1155-1160.[8]Chen J and Fossorier M P C. Near-optimum universal belief propagation based decoding of low-density parity check codes [J].IEEE Transactions on Communications.2002, 50(3):406-414[9]Divsalar D, Dolinar S, and Jones C, et al.. Capacity- approaching protograph codes [J].IEEE Journal on Selected Areas in Communications.2009, 27(6):876-888[10]Gounai S and Ohtsuki T. Decoding algorithms based on oscillation for Low-Density Parity Check codes [J].IEICE Transactions on Fundamentals.2005, E88-A(8):2216-2226[11]Zhang J, Fossorier M, and Gu D. Two-dimensional correction for min-sum decoding of irregular LDPC codes [J].IEEE Communications Letters.2006, 10(3):180-182[12]Divsalar D, Dolinar S, and Jones C. Low-rate LDPC codes with simple protograph structure [C]. Proceedings International Symposium on Information Theory, Adelaide, 2005: 1622-1626.Richter G, Schmidt G, and Bossert M, et al.. Optimization of a reduced-complexity decoding algorithm for LDPC codes by density evolution [C]. Proceedings 2005 IEEE International Conference on Communications, Seoul, Korea, 2005: 642-646.[13]Chen J, Dholakia A, and Eleftheriou E, et al.. Reduced- complexity decoding of LDPC codes [J].IEEE Transactions on Communications.2005, 53(8):1288-1299[14]Hu X Y, Eleftheriou E, and Arnold D M. Regular and irregular progressive edge-growth Tanner graphs [J].IEEE Transactions on Information Theory.2005, 51(1):386-398[15]Tian T, Jones C, and Villasenor J D, et al.. Selective avoidance of cycles in irregular LDPC code construction [J].IEEE Transactions on Communications.2004, 52(8):1242-1247

施引文献

资源附件(0)

访问统计