复数旋转码的迭代译码研究  

Iterative Decoding of Complex-rotary Codes

作　　者：文红 靳蕃[2] 胡飞[3] 

机构地区：[1]电子科技大学通信抗干扰国家级重点实验室 [2]西南交通大学计算机与通信工程学院,四川成都610031 [3]中国电子科技集团第三十研究所,四川成都610041

出　　处：《铁道学报》2005年第5期67-71,共5页Journal of the China Railway Society

基　　金：东南大学移动通信国家重点实验室开放课题基金资助项目(A200506)

摘　　要：基于置信传播(BP)迭代译码的Turbo码和LDPC码能非常地接近Shannon限,迭代译码算法的研究成为编码界的热点问题。本文研究了复数旋转码的BP迭代译码。复数旋转码的BP译码效果与差集循环码和有限几何码非常接近,优于类似参数的LDPC码。针对BP迭代译码算法复杂度较高的缺点,根据复数旋转码的特点提出了两种低复杂度的迭代译码方法,与BP译码方法相比,这两种译码算法复杂度大为降低。Due to its near-optimum decoding for low-density parity check （LDPC） codes and turbo codes, the belief propagation （BP） algorithm has recently received a lot of attention in the coding community. In this paper, the iterative decoding of complex-rotary codes （CRC） based on the belief propagation is researched. The decoding performance of CRC is as good as those of the finite geometry codes and the difference set cyclic codes. A modest performance gain is made over the low density parity check codes with similar parameters. Two new low complexity algorithms for decoding complex-rotary codes are developed. The complexity of the new algorithms is remarkably low in comparison with the BP algorithm.

关 键 词：复数旋转码 BP迭代译码 LDPC码 

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