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

一种低复杂度双二元卷积Turbo码译码算法
引用本文:姜春强,唐震宇,甘 明. 一种低复杂度双二元卷积Turbo码译码算法[J]. 电讯技术, 2016, 56(4): 412-415. DOI: 10.3969/j.issn.1001-893x.2016.04.011
作者姓名:姜春强  唐震宇  甘 明
作者单位:1. 海装重庆局,成都,610036;2. 国网四川省电力公司,四川 自贡,643000;3. 中国西南电子技术研究所,成都,610036
摘    要:双二元卷积Turbo码( DB CTC)的非二进制编码使得译码复杂度增加,限制了其在某些实际通信工程中的使用。在最大后验概率( MAP)译码算法的基础上,提出了一种优化算法,将译码的存储量和计算量降为原来的1/4。仿真结果表明:在不同编码长度和码率的情况下,优化算法与原算法性能相当;在误码率为10-5的条件下,两者的Eb/N0差异同样不大于0.1 dB。

关 键 词:卷积Turbo码  Log-MAP算法  循环递归  低复杂度译码

A low-complexity decoding algorithm for double binary convolutional Turbo codes
JIANG Chunqiang,TANG Zhenyu and GAN Ming. A low-complexity decoding algorithm for double binary convolutional Turbo codes[J]. Telecommunication Engineering, 2016, 56(4): 412-415. DOI: 10.3969/j.issn.1001-893x.2016.04.011
Authors:JIANG Chunqiang  TANG Zhenyu  GAN Ming
Affiliation:JIANG Chunqiang;TANG Zhenyu;GAN Ming;Military Representative Bureau of Navy Equipment Academy in Chongqing;State Grid Sichuan Electric Power Company;Southwest China Institute of Electronic Technology;
Abstract:The double binary convolutional Turbo code ( DB CTC ) cannot be widely applied in some pro-jects due to the high-complexity of decoding algorithm. In this paper,a new decoding algorithm with low-complexity for DB CTC is proposed based on the classic maximum a posteriori probability( MAP) decoding algorithm. By using the proposed algorithm,the storage cost and the computation complexity decrease by 3/4 compared with previous algorithm. Simulation results show that,when the bit error rate( BER) is 10-5 , the Eb/N0 deference between the proposed algorithm and the previous algorithm is not larger than 0. 1 dB for various lengths of code and code-rates.
Keywords:conventional Turbo code  Log-MAP algorithm  cycle recursion  low-complexity decoding
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《电讯技术》浏览原始摘要信息
点击此处可从《电讯技术》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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