一种改进的确定性准规则LDPC码

提出了一种确定性准规则LDPC码的设计方法,通过双对角矩阵以及迭代生成的线性同余序列构造校验矩阵.推导了为避免四边以及更少边的循环,迭代参数所需要满足的条件.该方法主要优点是编码仅具有线性复杂度,并且校验矩阵可通过迭代和双对角矩阵生成,在译码端不需要存储整个校验矩阵,这对于译码器的硬件实现是有利的.仿真结果表明该方法具有优于伪随机方法的性能.

A design for an improved deterministic quasi-regular LDPC codes

An ensemble of low density parity check (LDPC) codes,called deterministic quasi-regular LDPC codes, was proposed. These codes were completely defined by a dual-diagonal matrix and linear congruential sequences by using a simple recursion. To construct LDPC codes with no cycles of four sides or less, sufficient conditions on the recursion parameters were derived. The main advantage was that LDPC codes were possessed of linear encoding complexity, and the parity check matrix of the codes can be generated by using a recursion and a dual-diagonal matrix, rather than storing the parity check matrix in the memory of the decoder. It facilitated hardware implementation of the decoder. Simulation results showed that these codes provided better performance in comparison with a constrained pseudorandom construction.