一种简化的GF(q)-LDPC码译码算法

doi:10.3969/j.issn.1001-2400.2011.02.002

J4 ›› 2011, Vol. 38 ›› Issue (2): 8-12+196.doi: 10.3969/j.issn.1001-2400.2011.02.002

一种简化的GF(q)-LDPC码译码算法

胡树楷;王新梅

(西安电子科技大学综合业务网理论及关键技术国家重点实验室，陕西西安 710071)

收稿日期:2010-04-12 出版日期:2011-04-20 发布日期:2011-05-26
通讯作者: 胡树楷
作者简介:胡树楷(1981-)，男，西安电子科技大学博士研究生，E-mail: hushukai@sohu.com．
基金资助:
国家自然科学基金资助项目(U0635003);国家973项目基金资助项目(2010CB328300)

Simplified decoding algorithm for LDPC over GF(q)

HU Shukai;WANG Xinmei

(State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071， China)

Received:2010-04-12 Online:2011-04-20 Published:2011-05-26
Contact: HU Shukai

摘要/Abstract

摘要：

提出一种简单高效的GF(q)-LDPC码译码算法，将对数似然比和积译码算法中的雅可比对数利用一阶泰勒级数近似，从而降低译码时校验点计算的复杂度．与目前广泛应用的Offset min-sum算法相比较，在BER为10^-4处性能有0.2dB左右的提升，并且本算法中的参数设计独立于有限域的阶数．

关键词: 多元LDPC码, 和积译码算法, 最小和算法, 迭代译码

Abstract:

A simple, yet effective decoding algorithm for LDPC (low-density parity-check) codes over GF(q) is presented. By taking advantages of the first-term Taylor's series expansion to approximate the correction term of the Jacobian logarithm used in LLR-SPA(log-likelihood ratio sum-product algorithm), we propose an algorithm which significantly simplifies the check node update computation of the optimal LLR-SPA. Compared to the offset min-sum algorithm, the proposed algorithm achieves a gain of about 0.2dB at the BER of 10^-4. Moreover, unlike the offset min-sum algorithm, parameters of this algorithm are independent of the order of the Galois Filed.

Key words: nonbinary LDPC codes, sum-product algorithm, min-sum algorithm, iterative decoding

胡树楷;王新梅. 一种简化的GF(q)-LDPC码译码算法[J]. J4, 2011, 38(2): 8-12+196.

HU Shukai;WANG Xinmei. Simplified decoding algorithm for LDPC over GF(q)[J]. J4, 2011, 38(2): 8-12+196.

参考文献

［1］ Gallager R G. Low Density Parity-check Codes［D］. Cambridge: MIT Press, 1963.
［2］ Chung S, Jr Forney G D, Richardson T J, et al. On the Design of Low-density Parity-check Codes within 0.0045dB of the Shannon Limit［J］. IEEE Communications Letters, 2001, 5(2): 58-60.
［3］ Davey M C, Mackay D J C. Low Density Parity Check Codes over GF(q)［C］//Proceedings of 1998 Information Theory Workshop. San Diego: IEEE, 1998: 70-71.
［4］ Kschischang F R, Frey B J, Loeliger H A. Factor Graphs and the Sum-product Algorithm［J］. IEEE Trans on Information Theory, 2001, 47(2): 498-519.
［5］童胜, 王鹏, 王单, 等. LDPC码量化和积译码的高效实现［J］. 西安电子科技大学学报, 2004, 31(5): 709-713.
Tong Sheng, Wang Peng, Wang Dan, et al. Efficient Implementation of the Sum-product Algorithm for Quantized Decoding of LDPC Codes［J］. Journal of Xidian University, 2004, 31(5): 709-713.
［6］ Chen J, Dholakia A, Eleftheriou E, et al. Reduced-complexity Decoding of LDPC Codes［J］. IEEEJCOM, 2005, 53(8): 1288-1299.
［7］ Liao C H, Wang C Y, Liu C H, et al. An O(qlogq) Log-domain Decoder for Non-binary LDPC over GF(q)［C］//Proceedings of 2008 Asia Pacific Conference on Circuits and Systems. Macao: IEEE, 2008: 1644-1647.
［8］ Declercq D, Fossorier M. Decoding Algorithms for Nonbinary LDPC Codes Over GF(q)［J］. IEEE Trans on Communications, 2007, 55(4): 633-643.
［9］ Boutillon E, Conde-Canencia L. Bubble Check: a Simplified Algorithm for Elementary Check Node Processing in Extended Min-sum Non-binary LDPC Decoders［J］. Electronics Letters, 2010, 46(9): 633-634.
［10］ Li P, Leung W K, Wu K Y. Low-rate Turbo-Hadamard Codes［J］. IEEE Transactions on Information Theory, 2003, 49(12): 3213-3224.
［11］ Wymeersch H, Steendam H, Moeneclaey M. Log-domain Decoding of LDPC Codes over GF(q)［C］//Proceedings of 2004 International Conference on Communications. Paris: IEEE, 2004: 772-776.
［12］ Talakoub S, Sabeti L, Shahrrava B, et al. An Improved Max-log-MAP Algorithm for Turbo Decoding and Turbo Equalization［J］. IEEE Trans on Instrumentation and Measurement, 2007, 56(3): 1058-1063.
［13］ Papaharalabos S, Mathiopoulos P T. Simplified Sum-product Algorithm for Decoding LDPC Codes with Optimal Performance［J］. Electronics Letters, 2009, 45(2): 116-117.

[1]	范亚楠;王丽冲;姚秀娟;孟新. 交叠的分层置信度传播LDPC译码算法[J]. 西安电子科技大学学报, 2017, 44(2): 88-94.
[2]	郭军军;慕建君. 一种LDPC码有限字母表迭代译码器选择算法[J]. J4, 2013, 40(6): 111-115.
[3]	何光华;白宝明;李博;林伟. 采用EMS算法的多元LDPC译码器的FPGA实现[J]. J4, 2011, 38(5): 27-33.
[4]	周林;白宝明;邵军虎;林伟. 多元LDPC码的速率兼容技术研究[J]. J4, 2011, 38(1): 147-152.
[5]	杨洋;陈超;白宝明;王新梅. LDPC码串行译码策略的收敛速度分析[J]. J4, 2010, 37(5): 795-800.
[6]	刘原华;王新梅;胡树楷;陈汝伟. 一种改进的卷积LDPC码置信传播译码算法[J]. J4, 2009, 36(3): 424-447.
[7]	孙锦华;李自义. SCCPM中基于平均外信息交换的迭代停止算法[J]. J4, 2008, 35(4): 716-720.
[8]	车书玲;王新梅. 一种非相干检测下的低复杂度正交编码调制解调方案 [J]. J4, 2008, 35(2): 206-209.
[9]	宫丰奎;葛建华;王勇. 多维映射BICM-ID系统的SISO解映射算法 [J]. J4, 2007, 34(6): 895-899.
[10]	谢红;焉晓贞;罗清华. DS-CDMA系统中迭代多用户检测技术的研究 [J]. J4, 2007, 34(5): 748-752.
[11]	童胜;王鹏;王单;王新梅. LDPC码量化和积译码的高效实现[J]. J4, 2004, 31(5): 709-713.
[12]	刘伟;张海林;刘增基. 慢衰落信道中Turbo乘积编码PSAM的研究[J]. J4, 2002, 29(6): 809-813.
[13]	贺玉成;孙韶辉;慕建君;王新梅. 快速低密度校验码迭代译码量化算法[J]. J4, 2002, 29(2): 338-343.
[14]	孙韶辉;慕建君;王新梅. 低密度校验码研究及其新进展[J]. J4, 2001, 28(3): 393-398.

一种简化的GF(q)-LDPC码译码算法

Simplified decoding algorithm for LDPC over GF(q)

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 14

Metrics

本文评价

推荐阅读 10