基于满二叉树的RA码交织器设计  

Interleaver design for RA codes based on full binary tree

作　　者：张红泰 刘宏立[1] 刘述钢[1] 

机构地区：[1]湖南大学电气与信息工程学院,湖南长沙410082

出　　处：《计算机工程与科学》2015年第4期699-703,共5页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(61172089);湖南省科技厅资助项目(2012FJ4119)

摘　　要：为提高输入信息较长时重复累积码的编码效率,对重复累积码的交织器进行优化改进。按照满二叉树子节点的奇偶排列方式对交织器的输入序列依次分组,并利用叶子节点对分组信息重新组合获得输出序列,与S随机交织器相比,大大降低输入信息之间的相关性,避免了RA码校验矩阵中I、II类4环的产生,保证了译码的准确性。仿真结果表明,在输入信息序列较长时,改进的交织器编码速度快且误码率远低于行列规则交织器;与S随机交织器相比,改进的交织器可以显著提高编码速率,且在误码率同为1×10-4时约有0.3dB的增益。In order to improve the encoding efficiency of repeat accumulate codes under the circumstance of long input information, we present an optimized interleaver design for repeat accumulate codes. The input information sequence of interleaver is regrouped by the child nodes of full binary tree accord- ing to its parity arrangement, and the output sequence is obtained by using the leaf nodes to recombine the grouped sequence. Therefore, the relativity among input information is greatly reduced compared with S-random interleaver, and it prevents the class-I and class-II four circles of check matrix from being produced in the encoding process while the decoding accuracy is guaranteed. Simulation results show that the optimized interleaver is faster and its BER is far less than regular interleavers under long input information; and the optimized interleaver is much faster and has a better performance（about 0.3 dB） than S-random interleavers at the same BER of 1 ＊ 10^-4.

关 键 词：满二叉树 交织器 重复累积码 校验矩阵 S随机交织器 

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