不含短环的(n,3,k)LDPC码的几何构造方法

Geometry Construction of (n,3,k) LDPC Codes without Short Cycles

该文基于不含短环的(n,2,k)规则低密度奇偶校验(LDPC)码,提出了一种最短环长为8的(n,3,k)规则LDPC码的几何构造方法,该方法简单直观而有效。仿真结果显示,在AWGN信道中其具有明显优于随机构造的规则LDPC码的性能。

In this paper, based on （n,2,k） regular Low Density Parity-Check （LDPC） codes without short cycles, a geometry method for the construction of（n,3,k） regular LDPC codes with 8-girth is proposed,which is simple,intuitionistic and effective. Simulation results show that these codes achieve obviously better performance than randomly constructed regular LDPC codes over AWGN channals.