首页 | 本学科首页   官方微博 | 高级检索  
     检索      

复数旋转码的迭代译码研究
引用本文:文红,靳蕃,胡飞.复数旋转码的迭代译码研究[J].铁道学报,2005,27(5):67-71.
作者姓名:文红  靳蕃  胡飞
作者单位:1. 电子科技大学,通信抗干扰国家级重点实验室,四川,成都,610054;东南大学,移动通信国家重点实验室,江苏,南京,210096;西南交通大学,计算机与通信工程学院,四川,成都,610031
2. 西南交通大学,计算机与通信工程学院,四川,成都,610031
3. 中国电子科技集团,第三十研究所,四川,成都,610041
基金项目:东南大学移动通信国家重点实验室开放课题基金资助项目(A200506)
摘    要:基于置信传播(BP)迭代译码的Turbo码和LDPC码能非常地接近Shannon限,迭代译码算法的研究成为编码界的热点问题。本文研究了复数旋转码的BP迭代译码。复数旋转码的BP译码效果与差集循环码和有限几何码非常接近,优于类似参数的LDPC码。针对BP迭代译码算法复杂度较高的缺点,根据复数旋转码的特点提出了两种低复杂度的迭代译码方法,与BP译码方法相比,这两种译码算法复杂度大为降低。

关 键 词:复数旋转码  BP迭代译码  LDPC码
文章编号:1001-8360(2005)05-0067-05
收稿时间:2004-07-21
修稿时间:2005-05-22

Iterative Decoding of Complex-rotary Codes
WEN Hong,JIN Fan,HU Fei.Iterative Decoding of Complex-rotary Codes[J].Journal of the China railway Society,2005,27(5):67-71.
Authors:WEN Hong  JIN Fan  HU Fei
Institution:1. National Key Laboratory of Communication of UESTC, Chengdu 610054, China; 2. State Key Laboratory of Mobile Communication of Southeast University, Nanjing 210096, China; 3. School of Computer and Comm. Eng. , Southwest Jiaotong University, Chengdu 610031, China; 4. Institute No.30 of CETC, Chengdu 610041, China
Abstract: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.
Keywords:complex-rotary code  belief-propagation iterative decoding  LDPC code
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号