基于斐波那契数列短码长QC-LDPC码的构造

摘要

设计了一种QC-LDPC码的校验矩阵构造方法,矩阵的信息位根据斐波那契数列进行构造,校验位根据IEEE802.16e标准中码字的校验矩阵进行构造,这样构造的校验矩阵具有准双对角线结构,在编码过程中可以采用快速编码算法,降低了编码复杂度,同时节省了存储空间.通过仿真,该方法构造的码字在中短码范围内较Gallager码性能良好,并且通过改变循环矩阵的大小,可以获得码性能较好的多种码长的码字,码长选择范围较大.%This paper presents a construction method of quasi-cyclic low-density party-check( QC-LDPC) codes,whose in-formation parts are based on the Fbonacci sequence while the check parts are based on IEEE802. 16e standard.Because of the quasi dual-diagonal structure,it can lower the complexity and save the memory space through fast encoding algorithm.Simula-tion results show that the proposed codes is better than Gallager codes when the code length is shorter.Besides,there are many good codes at a lot of length by changing the size of the cyclic matrix.