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

J4 ›› 2015, Vol. 37 ›› Issue (04): 699-703.

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

张红泰，刘宏立，刘述钢

（湖南大学电气与信息工程学院，湖南长沙 410082）

收稿日期:2014-03-05 修回日期:2014-04-16 出版日期:2015-04-25 发布日期:2015-04-25
基金资助:
国家自然科学基金资助项目(61172089)；湖南省科技厅资助项目(2012FJ4119)

Interleaver design for RA codes based on full binary tree

ZHANG Hongtai,LIU Hongli,LIU Shugang

（College of Electrical and Information Engineering,Hunan University,Changsha 410082,China）

Received:2014-03-05 Revised:2014-04-16 Online:2015-04-25 Published:2015-04-25

摘要/Abstract

摘要：

为提高输入信息较长时重复累积码的编码效率，对重复累积码的交织器进行优化改进。按照满二叉树子节点的奇偶排列方式对交织器的输入序列依次分组，并利用叶子节点对分组信息重新组合获得输出序列，与S随机交织器相比，大大降低输入信息之间的相关性，避免了RA码校验矩阵中I、II类4环的产生，保证了译码的准确性。仿真结果表明，在输入信息序列较长时，改进的交织器编码速度快且误码率远低于行列规则交织器；与S随机交织器相比,改进的交织器可以显著提高编码速率，且在误码率同为1×10-4时约有0.3 dB的增益。

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

Abstract:

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 according 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.

Key words: full binary tree;interleaver;repeat accumulate code;check matrix;S-random interleaver

张红泰，刘宏立，刘述钢. 基于满二叉树的RA码交织器设计[J]. J4, 2015, 37(04): 699-703.

ZHANG Hongtai,LIU Hongli,LIU Shugang. Interleaver design for RA codes based on full binary tree [J]. J4, 2015, 37(04): 699-703.

参考文献

［1］Johnson S J, Weller S R. Combinatorial interleavers for systematic regular repeataccumulate codes［J］. IEEE Transactions on Communications, 2008, 56(8):12011206.
［2］Papaharalabos S,Papaleo M,Mathiopoulos P T,et al. DVBS2 LDPC decoding using robust check node update approximations［J］. IEEE Transactions on Broadcasting, 2008, 54(1):120126.
［3］Park C S, Kim S, Hwang S Y. Design of a lowarea, highthroughput LDPC decoder using shared memory banks for DVBS2［J］. IEEE Transactions on Consumer Electronics, 2009, 55(2):850854.
［4］Shi Zhiping, Zhang Zhongpei, Zhu Nan. Design of double repeat accumulate codes based on belief propagation decoding［J］. Journal of Electronics & Information Technology, 2008, 30(7):16441647.(in Chinese)
［5］Wen Wu, Xiao Erjing, Zhu Lianxiang. Interleaver design for qary regular RA codes based on improved PEG algorithm［J］. Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition), 2010, 22(2):196199.(in Chinese)
［6］Guruswami V, Machmouchi W. Explicit interleavers for a repeat accumulate accumulate (RAA) code construction［J］. Information Theory, 2008, 6(11):19681972.
［7］Liu Yongxia, Zhang Zhaohui, Zhang Yanmin. Image denoising based on Kmeans clustering and binary tree decision［J］. Computer Engineering & Science, 2013, 35(5):118123.(in Chinese)
［8］Beak S, Hieu B V, Lee H, et al. Novel binary tree Huffman decoding algorithm and field programmable gate array implementation for terrestrialdigital multimedia broadcasting mobile handheld［J］. IET Science, Measurement & Technology, 2012, 6(6):527532.
［9］Xu X, Liu C, Yang S X, et al. Hierarchical approximate policy iteration with binarytree state space decomposition［J］. IEEE Transactions on Neural Networks, 2011, 22(12):18631877.
［10］Johnson S, Lechner G. Spatially coupled repeataccumulate codes［J］. IEEE Communications Letters, 2013,2(17):373376.
［11］Han W K,Le Goff S Y,Sharif B S.Repeat accumulate codes for bitinterleaved coded modulation with iterative demapping［C］∥Proc of IEEE International Conference on Signal Processing and Communications, 2007:15431546.
［12］Gazi O, Yilmaz A. Collision free row column Srandom interleaver［J］. IEEE Communications Letters, 2009, 13(4):257259.
［13］Koutsouvelis K V, Dimakis C E. A low complexity algorithm for generating turbo code Srandom interleavers［J］. Wireless Personal Communications, 2008, 46(3):365370.
［14］Johnson S J, Weller S R. Practical interleavers for repeataccumulate codes［J］. IEEE Transactions on Communications, 2009, 57(5):12251228.
附中文参考文献：
［4］史治平, 张忠培, 朱南. 基于置信传播译码的 DRA 码设计［J］. 电子与信息学报, 2008, 30(7):16441647.
［5］文武, 肖而靖, 朱联祥. 基于改进 PEG 算法的多元 RA 码交织器设计［J］. 重庆邮电大学学报（自然科学版）, 2010, 22(2):196199.
［7］刘永霞, 张朝晖, 张艳敏. 基于(K0均值聚类及二叉树决策的图像去噪［J］. 计算机工程与科学, 2013, 35(5):118123.

[1]	陈平华，陈传瑜. 基于满二叉树的二分K-means聚类并行推荐算法[J]. J4, 2015, 37(08): 1450-1457.
[2]	孙安玉,江贵平. 基于满二叉树分块策略的大规模数据场纹理映射体绘制算法[J]. J4, 2011, 33(3): 57-61.
[3]	彭立朱光喜. Q-矩阵准规则LDPC码编码器设计方案的研究[J]. J4, 2005, 27(6): 81-82.