A Code-matched Interleaver Design based on the Parity-Check Weight Low-bound of Component Codes for Turbo Codes
Considering the Interleaver optimization of short frame turbo codes, a code-matched interleaver design based on the parity weight low-bound of component codes is proposed. The form of Locally-bad in turbo codes is investigated. To improve the bit-error property of short frame turbo codes, an algorithm for estimating the low-bound of recursive systematic convolutional code (RSC) parity weight is proposed. This algorithm for estimating the parity-check weight low-bound of component codes is adopted to select the excellent mapping way. Only the mapping ways that can promise the codewords weight of all the Locally-bad in turbo codes will be selected. Compared with the several existing interleaver design, Simulation results show that the proposed code-matched interleaver design is more excellent. The code-matched interleaver design algorithm proposed in this article can improve the bit-error property of short frame turbo codes obviously.
Yu Dongfeng Zhang Wenqiang Lu Zhiling Xiao Yong Zhao Lingzhi Zou Xia
Unit 61920 of PLA, Chengdu, 610505, China Institute of computer science and technology, Chongqing University of Posts and Telecommunications, Institute of Command Automation, PLA Univ.of Sci.& Tech., Nanjing, 210007, China
国际会议
上海
英文
1-6
2010-10-20（万方平台首次上网日期，不代表论文的发表时间）