一种基于递归系统卷积码校验重量下限的匹配交织器设计方法  

A Code-matched Interleaver Design Based On The Low-bound of RSC Parity Weight

作　　者：肖勇[1] 张雄伟[1] 邹霞[1] 崔姚 

机构地区：[1]解放军理工大学通信工程学院,南京210007 [2]通信指挥学院,武汉430000

出　　处：《信号处理》2009年第9期1366-1370,共5页Journal of Signal Processing

基　　金：江苏省"333高层次人才培养工程"资助项目;江苏省自然科学基金资助项目(BK2006001)

摘　　要：针对短帧Turbo码中交织器优化设计问题,提出了一种基于递归系统卷积码(RSC)校验重量下限的匹配交织器设计方法。文中重新分析了Turbo码中"局部坏点"具体形式,然后提出并证明了一种估计RSC分量码校验序列重量下限的方法,并将其应用于交织器映射方式优选时局部坏点对应Turbo码字重量下限估计,只有能够保证所有局部坏点对应码字重最的交织方法才被认为合法。仿真表明,与几种现有交织器设计方法相比,本文提出的匹配交织器设计方法性能更加优良,可以有效改善Turbo码的误比特性能。Considering the interleaver optimization of short frame turbo codes, a code-matched interleaver design based on the parity weight low-bound of recursive systematic convolutional code （RSC） 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 RSC parity weight is proposed. This algorithm for estimating the low-bound of RSC parity weight is adopted to select the mapping way. The slected mapping way can promise the codewords weight of all the locally-bad in turbo codes. 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 turbo codes obviously.

关 键 词：TURBO编码 匹配交织器 短交织器设计 S交织器 码字重量 

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