多元LDPC编码调制系统中低复杂度的似然概率生成算法

doi:10.3969/j.issn.1000-436x.2013.09.011

通信学报 ›› 2013, Vol. 34 ›› Issue (9): 84-91.doi: 10.3969/j.issn.1000-436x.2013.09.011

多元LDPC编码调制系统中低复杂度的似然概率生成算法

何光华¹,白宝明^1,³,马啸²,黎昞¹

¹ 西安电子科技大学综合业务网理论及关键技术国家重点实验室，陕西西安 710071
² 中山大学信息科学与技术学院，广东广州 510275
³ 空间微波技术重点实验室，陕西西安 710100

出版日期:2013-09-25 发布日期:2017-07-05
基金资助:
国家重点基础研究发展计划(“973”计划)基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;空间微波技术重点实验室开放课题基金资助项目

Low-complexity likelihood probability derivation algorithm for non-binary LDPC-coded modulation system

Guang-hua HE¹,Bao-ming BAI^1,³,Xiao MA²,Bing LI¹

¹ State Key Lab of Integrated Service Networks,Xidian University,Xi'an 710071,China
² School of Information Science and Technology,Sun Yat-sen University,Guangzhou 510275,China
³ Science and Technology on Space Microwave Laborator,Xi'an 710100,China

Online:2013-09-25 Published:2017-07-05
Supported by:
The National Basic Research Program of China (973 Program);The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Fund of National Key Laboratory Foundation of China

摘要/Abstract

摘要：

在采用多元LDPC码的通信系统中，尤其当使用高阶调制方案时，输入到译码器中的似然概率计算复杂度非常高。其主要原因是由于似然概率通常是关于信道输出的复杂函数，其计算需已知信道参数。针对上述问题，提出了一种低复杂度的近似似然概率生成算法。依据接收信号和星座点之间的欧氏距离，将星座点所对应的有限域 GF(q)上域元素的似然概率进行分块逼近，能够以较低复杂度快速生成译码器所需要的概率度量。仿真结果表明，所提出的分块似然概率逼近生成算法在译码性能上损失较小且极大降低了似然概率生成的计算复杂度，是一种适用于高速多元LDPC译码器前端实现的候选算法。

关键词: 多元LDPC码, 似然概率, 译码器, 解调

Abstract:

The derivation of likelihood probabilities which are sent into the decoder in many LDPC-coded modulation systems is a challenging task especially when high-order modulations are used.This is because likelihood probabilities are usually complicated functions of the channel output and their calculation also requires knowledge of the channel parameters.To this end,a low-complexity likelihood probability derivation algorithm was proposed.Also,the Euclidean distance between the received signal and the constellation points was considered to divide the constellation points into two signal sets.Simulation results show that the proposed algorithm provides good trade-offs between performance and complexity,making it a good candidate for the hardware implementation of the front-end in the non-binary LDPC decoders.

Key words: non-binary LDPC codes, likelihood probabilities, decoder, demodulations

何光华,白宝明,马啸,黎昞. 多元LDPC编码调制系统中低复杂度的似然概率生成算法[J]. 通信学报, 2013, 34(9): 84-91.

Guang-hua HE,Bao-ming BAI,Xiao MA,Bing LI. Low-complexity likelihood probability derivation algorithm for non-binary LDPC-coded modulation system[J]. Journal on Communications, 2013, 34(9): 84-91.

图/表 11

图1

图2

图3

图4

图5

图6

图7

图8

图9

图10

表1

参考文献 19

[1]	GALLAGER R G . Low-density parity-check codes[J]. IRE Trans Information Theory, 1962,8(1): 21-28.
[2]	DAVEY M C , MACKAY D J C . Low density parity check codes over GF(q)[J]. IEEE Commun Lett, 1998,2(6): 165-167.
[3]	HASSANI S , HAMON M,P′ENARD P . A comparison study of binary and non-binary LDPC codes decoding[A]. Proc Software,International Conference on Telecommunications and Computer Networks[C]. Dalmatia,Croatia, 2010. 355-359.
[4]	HU X Y , ELEFTHERIOU E . Binary representation of cycle tannergraph GF(2q) codes[A]. Proc IEEE Int Conf Commun[C]. Paris,France, 2004. 528-532.
[5]	LI G , FAIR I J , KRZYMIEN W A . Density evolution for no inary LDPC codes under gaussian approximation[J]. IEEE Trans Inform Theory, 2009,55(3): 997-1015.
[6]	ZENG L , LAN L , TAI Y ,et al. Constructions of nonbinary quasicyclic LDPC codes:a finite field approach[J]. IEEE Trans Commun, 2008,56(4): 545-554.
[7]	ZENG L , LAN L , TAI Y ,et al. Constructions of nonbinary quasicyclic LDPC codes:a finite geometry approach[J]. IEEE Trans Commun, 2008,56(3): 378-587.
[8]	Supplement to IEEE Standard for Information Technology-Telecommunications and Information Exchange Between Systems-Local and Metropolitan Area Networks-Specific Requirements,Part 11:Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications:Higher-Speed Physical Layer Extension in the 5 GHz Band[S]. 2003.
[9]	MACKAY D J C , DAVEY M C . Evaluation of gallager codes hort block length and high rate application[A]. Proc IMA International Conference on Mathematic and Its Applications:Codes,Systems and Graphical Models[C]. New York,USA, 2000. 113-133.
[10]	DECLERCQ D , FOSSORIER M . Extended min-sum algorithms for decoding LDPC codes over GF(q)[J]. IEEE Trans Inform Theory, 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 Transactions on Communications, 2010,58(5): 1355-1375.
[12]	WANG X , BAI B , MA X . A low-complexity joint dection-decoding algorithm for nonbinary LDPC-coded modulation syatems[A]. International Symposium on Informantion Theory (ISIT 2011)[C]. Austin, 2010. 794-798.
[13]	ZHAO D,MA X , CHEN C , et a l . A low complexity decoding algorithm for majority-logic decodable nonbinary LDPC codes[J]. IEEE Commun Lett, 2010,14(11): 1062-1064.
[14]	SARKIS G , MANNOR S , GROSS W J . Stochastic decoding of LDPC codes over GF(q)[A]. Proc IEEE ICC ’09[C]. Dresden, 2009. 1-5.
[15]	YAZDANI R , ARDAKANI M . Piecewise linear LLR approximation for non-binary modulations over gaussian channels with unknown noise variance[A]. 2010 IEEE 17th International Conference on Telecommunications (ICT 2010)[C]. Doha, 2010. 1-7.
[16]	YAZDANI R , ARDAKANI M . Efficient LLR calculation for nonbinary modulations over fading channels[J]. IEEE Trans Commun, 2011,59(5): 1236-1241.
[17]	WANG X X , MA X . A class of generalized LDPC codes with fast parallel decoding algorithms[J]. IEEE Commun Lett, 2009,13(7): 531-533.
[18]	LIN W,BAI B , LI Y , et a l . Design of q-ary irregular repeat-accumulate codes[A]. International Conference on Advanced Information Networking and Applications (AINA 2009)[C]. Bradford, 2009. 201-206.
[19]	POULLIAT C , FOSSORIER M , DECLERCQ D . Design of regular(2,dc)-LDPC codes over GF(q) using their binary images[J]. IEEE Trans Commun, 2008,56(3): 1626-1635.

概率生成算法	+	*	÷	exp	LUT
本文提出算法	5q?21	2q?4	1	0	4
精确解调算法	4q?1	5q	2q+1	q	0

多元LDPC编码调制系统中低复杂度的似然概率生成算法

Low-complexity likelihood probability derivation algorithm for non-binary LDPC-coded modulation system

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 11

参考文献 19

相关文章 12

Metrics

推荐阅读 0

[1]	田文飚,王鹏,芮国胜,张洋. 基于差分复合网格的MSK非相干解调算法[J]. 通信学报, 2018, 39(12): 160-166.
[2]	孙锦华,韩会梅. 递归SOQPSK-TG信号的两状态判决反馈解调算法[J]. 通信学报, 2014, 35(7): 56-62.
[3]	孙锦华，韩会梅. 递归SOQPSK-TG信号的两状态判决反馈解调算法[J]. 通信学报, 2014, 35(7): 7-62.
[4]	王利娇，张林，杨玲玲，彭立，符达伟. 具有低复杂度的LDPC已编码非相干酉空时调制系统设计[J]. 通信学报, 2014, 35(2): 19-152.
[5]	王利娇,张林,杨玲玲,彭立,符达伟. 具有低复杂度的LDPC已编码非相干酉空时调制系统设计[J]. 通信学报, 2014, 35(2): 146-152.
[6]	戴晓洁,詹亚锋. 短帧长CCPM信号优化设计及简化译码[J]. 通信学报, 2013, 34(5): 121-125.
[7]	戴晓洁，詹亚锋. 短帧长CCPM信号优化设计及简化译码[J]. 通信学报, 2013, 34(5): 14-125.
[8]	宋汉斌,张俊博,陈晓光,张建秋. 三维极化幅度调制解调器[J]. 通信学报, 2012, 33(9): 15-22.
[9]	袁瑞佳,白宝明. 基于FPGA的部分并行QC-LDPC译码器高效存储方法[J]. 通信学报, 2012, 33(11): 165-170.
[10]	廖灿辉,黄渊凌,周世东. 卫星成对载波多址信号的一种联合分离解调算法[J]. 通信学报, 2010, 31(6): 99-105.
[11]	潘克刚,张邦宁,郭道省. 基于FFT的星上多路FDMA/FSK信号解调研究[J]. 通信学报, 2006, 27(8): 82-86.
[12]	吴团锋,杨喜根. Turbo编码GMSK信号准相干解调时的迭代信道估计和译码研究[J]. 通信学报, 2006, 27(7): 106-111.