基于扩大候选码元范围的非二元LDPC加权迭代硬可靠度译码算法  

Decoding algorithm of weighted iterative hard-reliability for non-binary LDPC codes based on expanding range of candidate code symbols

作　　者：马秀荣 司雨鑫[1,2] 孔玲 MA Xiu-rong;SI Yu-xin;KONG Ling(School of Electrical and Electronic Engineering,Tianjin University of Technology,Tianjin 300384,China;Engineering Research Center for Optoelectronic Devices and Communication Technology of Ministry of Education,Tianjin University of Technology,Tianjin 300384,China;Integrated Technical Communication Station,93303 Troops,Shenyang 110069,China)

机构地区：[1]天津理工大学电气电子工程学院,天津300384 [2]天津理工大学光电器件与通信技术教育部工程研究中心,天津300384 [3]93303部队综合技术通信站,沈阳110069

出　　处：《沈阳工业大学学报》2021年第6期668-673,共6页Journal of Shenyang University of Technology

基　　金：国家级重点实验室创新发展基金项目(6142413190101).

摘　　要：为提高非二元LDPC码加权迭代硬可靠度译码算法的误码率性能,设计了一种基于扩大候选码元范围的加权迭代硬可靠度译码算法.通过对可靠度更新过程进行扩展,引入更多初始化元素,从而有效扩大了备选码元的范围,降低了译码结果中产生错误码元的概率.仿真结果显示,对基于伽罗华域GF(26)的(315,265)码进行译码时,改进后译码算法的比特误码率性能增益约为0.1 dB,对基于GF(2^(8))的(1275,1025)码进行译码时,改进后译码算法的比特误码率性能增益约为0.2 dB,在这两种情况下,改进算法的译码时间增加均小于2%.In order to improve the bit-error-rate performance of decoding algorithm of weighted iterative hard-reliability for non-binary LDPC codes,a decoding algorithm of weighted iterative hard-reliability based on the expanding range of candidate code symbols was designed.By extending the reliability update process and introducing more initialization elements,the range of candidate code symbols can be expanded effectively,and the probability of error codes generated in decoding results was reduced.The simulation results show that the bit-error-rate performance gain of the improved algorithm is about 0.1 dB when decoding the(315,265)code over GF(26),and the bit-error-rate performance gain of the improved algorithm is about 0.2 dB when decoding the code of(1275,1025)over GF(2^(8)),while the decoding time of the improved algorithm increases less than 2%in both cases.

关 键 词：非二元LDPC码 迭代译码 硬可靠度 比特误码率 候选码元 可靠度更新过程 初始化元素 

分 类 号：TN911.22[电子电信—通信与信息系统]