多元LDPC码的动态扩展最小和译码算法

doi:10.3969/j.issn.1001-2400.2012.02.011

J4 ›› 2012, Vol. 39 ›› Issue (2): 59-65.doi: 10.3969/j.issn.1001-2400.2012.02.011

多元LDPC码的动态扩展最小和译码算法

林伟;白宝明;王雪鹏

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

收稿日期:2011-05-07 出版日期:2012-04-20 发布日期:2012-05-21
通讯作者: 林伟
作者简介:林伟(1982-)，西安电子科技大学博士研究生，E-mail: linwei@mail.xidian.edu.cn．
基金资助:
国家科技重大专项资助项目(2009ZX03003-011)(2010ZX03003-003-03);国家自然科学基金资助项目(60972046,61001130);教育部长江学者和创新团队发展计划资助项目(IRT0852)

Dynamic extended mim-sum decoding algorithm for Q-ary LDPC codes

LIN Wei;BAI Baoming;WANG Xuepeng

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

Received:2011-05-07 Online:2012-04-20 Published:2012-05-21
Contact: LIN Wei

摘要/Abstract

摘要：

多元LDPC码采用扩展最小和(EMS)算法进行译码时，若消息向量长度取值过小，则性能相对其采用多元和积算法(QSPA)有很大损失．针对该问题，提出了一种动态扩展最小和(D-EMS)译码算法．首先，基于Monte Carlo方法研究了消息向量中有效似然值在各GF(q)符号间的分布，得出随着译码迭代次数的增加，有效似然值逐渐集中于少部分符号．因此，D-EMS译码算法先将消息向量长度设为n_m1，一定迭代次数后再将其截短为n_m2，这样译码复杂度可得到有效降低．同时，为了降低译码器实数比较运算复杂度，D-EMS算法校验节点基本步骤采用检泡(BC)算法．复杂度分析和仿真结果表明，在合理的参数设置下，D-EMS算法在有效降低EMS算法译码复杂度的同时，其性能在AWGN和Rayleigh衰落信道下均逼近相应EMS算法，因此可有效应用于基于多元LDPC码的实际通信系统．

关键词: LDPC码, 有限域, 检泡, 扩展最小和

Abstract:

Decoded with the extended min-sum (EMS) algorithm, q-ary LDPC codes suffer great performance degradation compared with that decoded with the q-ary sum-product algorithm (QSPA) in case the length n_m of message vectors is too small. To solve this problem, a dynamic EMS (D-EMS) algorithm is proposed in this paper. First, we examined the distribution of likelihood values among GF(q) symbols in the message vectors, and concluded that the likelihood values would concentrate to a small portion of symbols as the iteration number increases. Therefore, the D-EMS algorithm first set the length of message vectors to n_m1, then truncate it to n_m2 after certain decoding iterations, thus the decoding computational complexity can be efficiently reduced. Meanwhile, in order to reduce the complexity of real comparisons in the decoder, the proposed algorithm employs the bubble check (BC) algorithm during the check node elementary steps. Complexity analysis and simulation results indicate that, under appropriate parameter configurations, while efficiently reducing the decoding complexity of the EMS algorithm, the D-EMS algorithm performs nearly as well as the corresponding EMS algorithm over both AWGN and Rayleigh fading channels, and thus can be efficiently applied to practical communication systems based on q-ary LDPC codes.

Key words: LDPC codes, finite field, extended min-sum, bubble check

中图分类号:

TN911.22

林伟;白宝明;王雪鹏. 多元LDPC码的动态扩展最小和译码算法[J]. J4, 2012, 39(2): 59-65.

LIN Wei;BAI Baoming;WANG Xuepeng. Dynamic extended mim-sum decoding algorithm for Q-ary LDPC codes[J]. J4, 2012, 39(2): 59-65.

参考文献

［1］ Gallager R G. Low-Density Parity-Check Codes ［J］. IRE Trans on Information Theory, 1962, 8(1): 21-28.
［2］ Davey M, MacKay D. Low-density Parity Check Codes over GF(q) ［J］. IEEE Communications Letters, 1998, 2(6): 165-167.
［3］周林, 白宝明, 邵军虎, 等. 多元LDPC码的速率兼容技术研究［J］. 西安电子科技大学学报, 2011, 38(1): 147-152.
Zhou Lin, Bai Baoming, Shao Junhu, et al. On Nonbinary Rate-compatible LDPC Codes ［J］. Journal of Xidian University, 2011, 38(1): 147-152.
［4］ Hu Xiaoyu, Eleftheriou E. Binary Representation of Cycle Tanner-graph GF(2^b) Codes ［C］//IEEE International Conference on Communications: 1. Paris: IEEE, 2004: 528-532.
［5］ Zeng Lingqi, Lan Lan, Tai Yingyu, et al. Constructions of Nonbinary Quasi-cyclic LDPC Codes: a Finite Field Approach ［J］. IEEE Trans on Communications, 2008, 56(4): 545-554.
［6］ Song Hongxin, Cruz J R. Reduced-complexity Decoding of Q-ary LDPC Codes for Magnetic Recording ［J］. IEEE Trans on Magnetics, 2003, 39(2): 1081-1087.
［7］ Rong Bo, Jiang Tao, Li Xiangming, et al. Combine LDPC Codes over GF(q) with q-ary Modulations for Bandwidth Efficient Transmission ［J］. IEEE Trans on Broadcasting, 2008, 54(1): 78-84.
［8］ Barnault L, Declercq D. Fast Decoding Algorithm for LDPC over GF(2^q) ［C］//IEEE Information Theory Workshop Proceedings. Paris: IEEE, 2003: 70-73.
［9］ Wymeersch H, Steendam H, Moeneclaey M. Log-domain Decoding of LDPC Codes over GF(q) ［C］//IEEE International Conference on Communications: 4. Paris: IEEE, 2004: 772-776.
［10］ Declercq D, Fossorier M. Decoding Algorithms for Nonbinary LDPC Codes over GF(q) ［J］. IEEE Trans on Communications, 2007, 55(4): 633-643.
［11］ Voicila A, Declercq D, Verdier F, et al. Low-complexity Decoding for Non-binary LDPC Codes in High Order Fields ［J］. IEEE Trans on Communications, 2010, 58(5): 1365-1375.
［12］ 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.
［13］ Xiao Chengshan, Zheng Y R, Beaulieu N C. Novel Sum-of-sinusoids Simulation Models for Rayleigh and Rician Fading Channels ［J］. IEEE Trans on Wireless Communications, 2006, 5(12): 3667-3678.

[1]	李润洲,黄勤. 二进制准循环码的加法傅里叶变换编码算法[J]. 西安电子科技大学学报, 2020, 47(6): 21-29.
[2]	王明伟;胡予濮. 一种前向-后向安全的数字签名方案[J]. J4, 2014, 41(2): 71-78.
[3]	刘景美;王延丽;梁斌;赵森林. 相关准循环码字集方法攻击McEliece密码体制[J]. J4, 2014, 41(2): 15-19+50.
[4]	王静怡;李颖;孙岳. 适用于网络LDPC码的速率兼容算法[J]. J4, 2013, 40(2): 13-17+47.
[5]	肖鹤玲;蔡宁;王骁. 量子LDPC码在量子密钥分配中的应用[J]. J4, 2012, 39(2): 8-11+23.
[6]	吕喜在;黄芝平;苏绍璟. BCH码生成多项式快速识别方法[J]. J4, 2011, 38(6): 159-162+172.
[7]	何光华;白宝明;李博;林伟. 采用EMS算法的多元LDPC译码器的FPGA实现[J]. J4, 2011, 38(5): 27-33.
[8]	张国华；王新梅. 一类围长至少为6的QC-LDPC码的存在性[J]. J4, 2011, 38(3): 136-139+149.
[9]	胡树楷;王新梅. 一种简化的GF(q)-LDPC码译码算法[J]. J4, 2011, 38(2): 8-12+196.
[10]	周林;白宝明;邵军虎;林伟. 多元LDPC码的速率兼容技术研究[J]. J4, 2011, 38(1): 147-152.
[11]	邵军虎周林白宝明林伟. 多元量子LDPC码的构造与译码[J]. J4, 2010, 37(6): 1005-1010.
[12]	杨洋;陈超;白宝明;王新梅. LDPC码串行译码策略的收敛速度分析[J]. J4, 2010, 37(5): 795-800.
[13]	慕建君;焦晓鹏;曹训志. 一类逼近容量LDPC纠删码的二部图构造算法[J]. J4, 2010, 37(4): 705-709.
[14]	崔俊云;白宝明;郭旭东. 一种改进的准循环LDPC码环消除算法[J]. J4, 2010, 37(4): 700-704.
[15]	刘原华;王新梅;胡树楷;陈汝伟. 一种改进的卷积LDPC码置信传播译码算法[J]. J4, 2009, 36(3): 424-447.

多元LDPC码的动态扩展最小和译码算法

Dynamic extended mim-sum decoding algorithm for Q-ary LDPC codes

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

Metrics

本文评价

推荐阅读 10