论文:2017,Vol:35,Issue(3):523-527
引用本文:
徐娟, 姚如贵, 高凡琪, 陆亚南. 改善3D-Turbo码错误平台性能的不规则抽取方案设计研究[J]. 西北工业大学学报
Xu Juan, Yao Rugui, Gao Fanqi, Lu Ya'nan. Irregular Pattern Design to Improve Error Floor for 3D-Turbo Codes[J]. Northwestern polytechnical university

改善3D-Turbo码错误平台性能的不规则抽取方案设计研究
徐娟1, 姚如贵2, 高凡琪2, 陆亚南2
1. 长安大学 电控学院, 陕西 西安 710064;
2. 西北工业大学 电子信息学院, 陕西 西安 710072
摘要:
针对3D-Turbo码中仍然存在的低码重码字,以全零迭代译码算法作为码字距离谱分析工具,识别低码重信息比特和校验比特中"1"的分布,优化设计不规则抽取模式,进一步提高最小汉明距离,进而改善错误平台性能。最后,以一种3D-Turbo码为实例,利用文中所提的改进抽取方式,将最小码重从18提高到20,证明了改进抽取方案的有效性。
关键词:    信道编码    错误平台    迭代译码    汉明距离   
Irregular Pattern Design to Improve Error Floor for 3D-Turbo Codes
Xu Juan1, Yao Rugui2, Gao Fanqi2, Lu Ya'nan2
1. School of Electronic and Control Engineering, Chang'an University, Xi'an 710064, China;
2. School of Electronics and Information, Northwestern Polytechnical University, Xi'an 710072, China
Abstract:
In 3D-Turbo codes, part of parity bits from conventional Turbo encoder are encoded again by a post-encoder to reduce the number of low-weight codes and achieve better error floor performance. Considering the residual low-weight codes in 3D-Turbo codes, an irregular pattern design is proposed to further improve the error floor. All-zero iterative decoding algorithm is firstly utilized to identify the distribution of "1" in low-weight codes. Then an irregular pattern is optimized based on the distribution to eliminate low-weight codes. Finally, taking a practical 3D-Turbo codes, we adopt the proposed irregular pattern to increase the minimum Hamming distance from 18 to 20, which validates the effectiveness of our contribution.
Key words:    channel coding    error floor    iterative decoding    Hamming distance   
收稿日期: 2016-10-17     修回日期:
DOI:
基金项目: 国家自然科学基金(61501376)、中央高校基本科研业务费专项基金(3102016ZY020、310832151095)和陕西省留学人员科技活动择优资助项目(W021004)资助
通讯作者:     Email:
作者简介: 徐娟(1980-),女,长安大学副教授、博士,主要从事无线通信技术、通信与导航抗干扰研究。
相关功能
PDF(1175KB) Free
打印本文
把本文推荐给朋友
作者相关文章
徐娟  在本刊中的所有文章
姚如贵  在本刊中的所有文章
高凡琪  在本刊中的所有文章
陆亚南  在本刊中的所有文章

参考文献:
[1] Berrou C, Glavieux A, Thitimajshima P. Near Shannon Limit Error-Correcting Coding And Decoding:Turbo-Codes[C]//International Conference on Communications (ICC'93), 1993:1064-1070
[2] Berrou C, Graell I A A, Ouid C M Y, et al. Adding a Rate-1 Third Dimension to Turbo Codes[C]//IEEE Information Theory Workshop (ITW'07), 2007:156-161
[3] Rosnes E, Graell I A A. Performance Analysis of 3-Dimensional Turbo Codes[J]. IEEE Trans on Information Theory, 2011, 57(6):3707-3720
[4] Rosnes E, Helmling E, Graell I A A. Pseudocodewords of Linear Programming Decoding of 3-Dimensional Turbo Codes[C]//IEEE International Symposium on Information Theory(ISIT 2011), 2011:1643-1647
[5] Rosnes E, Helmling E, Graell I A A. Minimum Pseudoweight Analysis of 3-Dimensional Turbo Codes[J]. IEEE Trans on Communications, 2014, 62(7):2170-2182
[6] Yao Rugui, Li Lu, Xu Juan, et al. Improving BER Performance with a BICM System of 3D-Turbo Code and Rotated Mapping QAM[C]//IEEE 26th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC 2015), 2015:451-455
[7] 魏宇星,李绍胜. 深空通信信道编码方式研究[EB/OL]. (2014-7-25). http://www.paper.edu.cn/releasepaper/content/201407-321
[8] Berrou C, Graell I A A, Ouid C M Y, et al. Improving the Distance Properties of Turbo Codes Using A Third Component Code:3D Turbo Codes[J]. IEEE Trans on Communications, 2009, 57(9):2505-2509
[9] 姚如贵, 高凡琪, 徐娟, 张昆. 新型3D-Turbo码原理分析与性能研究[J]. 哈尔滨工业大学学报, 2014, 46(11):95-100 Yao Rugui, Gao Fanqi, Xu Juan, Zhang Kun. Theoretical Analysis and Performance Study of 3-Dimension Turbo Codes[J]. Journal of Harbin Institute of Technology, 46(11):95-100(in Chinese)
[10] Kbaier B I D, Douillard C, Kerouedan S. Analysis of 3-Dimensional Turbo Codes[J]. Annual Telecommunications, 2011, 65(7):257-268
[11] Garello R, Pierleoni P, Benedetto S. Computing the Free Distance of Turbo Codes And Serially Concatenated Codes with Interleavers:Algorithms And Applications[J]. IEEE Journal on Selected Areas in Communications, 2001, 19(5):800-812
[12] Benedetto S, Montorsi G. Design of Parallel Concatenated Convolutional Codes[J]. IEEE Trans on Communications, 1996, 44(5):591-600
[13] Seghers J. On the Free Distance of Turbo Codes And Related Product Codes[R]. Final Report, Diploma Project, 1995
[14] Berrou C, Vaton S, Jezequel M, et al. Computing the Minimum Distance of Linear Codes by the Error Impulse Method[C]//IEEE Global Telecommunications Conference (GLOBECOM 2002), 2002:1017-1020
[15] Garello R, Vila-Casado A. The All-Zero Iterative Decoding Algorithm for Turbo Code Minimum Distance Computation[C]//IEEE International Conference on Communications (ICC 2004), 2004:361-364