一种基于循环矩阵扩展的广义RA码优化设计  

Optimization Design of Generalized RA Codes Based on Filling with Circulant Permutation Matrices

作　　者：刘朋利[1] 徐友云[2] 李杰[1] 

机构地区：[1]解放军理工大学通信工程学院研究生3队,江苏南京210007 [2]解放军理工大学通信工程学院无线通信系

出　　处：《军事通信技术》2010年第2期15-18,52,共5页Journal of Military Communications Technology

摘　　要：由重复器、交织器、组合器和广义累加器组成的广义系统RA码,在译码时可采用置信传播译码算法,其性能受校验矩阵的小环影响较大。文章通过先进行交织器设计,后进行循环移位矩阵填充的方式,给出了一种广义RA码的优化设计方法。仿真结果表明,该设计方法可以有效缩少校验矩阵中短环的数量,从而提高误码性能,且结构简单,易于实现。The systematic generalized repeat-accumulate code is constituted by a repeater,an interleaver,a combiner and a generalized accumulator.Under the Belief Propagation(BP) decoding of Low Density Parity Check(LDPC) codes,the performance of the GRA codes is affected by small cycles of the sparse parity check matrix which depends on encoding method.In this paper,an optimized method for constructing GRA codes was presented by filling the base parity check matrix with quasic-cyclic permutation matrices.Simulation result shows that despite the simple architecture and practical implementation the designed codes outperform the conventional RA codes on its simplication of architecture and practice in implementation.

关 键 词：低密度奇偶校验码 广义重复累积码 循环置换矩阵 交织器 

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