论文部分内容阅读
LDPC码是一种逼近香农限 ,实现容易 ,系统复杂度低的优秀的线性纠错码。奇偶校验矩阵 H是决定一个 LDPC码性能的关键。本文针对规则 LDPC码 ,提出了两种随机构造 H的方式 :行列都均匀的 evenboth和仅列均匀的 evencol。通过仿真分析发现 ,由 evenboth方式生成的规则 LDPC码性能更好。本文还对规则 LDPC码与卷积码的性能进行了对比 ,证明了规则 LDPC码在中短帧传输下的优异性能。这对 LDPC码投入实际应用具有重要的意义
The LDPC code is an excellent linear error correction code approaching Shannon limit, easy to implement and low system complexity. The parity check matrix H is the key to determining the performance of an LDPC code. In this paper, for the regular LDPC codes, two ways of randomly constructing H are proposed: evenboth with even columns and uniform evencol with even columns. Through the simulation analysis, it is found that the regular LDPC codes generated by the evenboth method perform better. This paper also compares the performance of regular LDPC codes with that of convolutional codes, and proves the excellent performance of regular LDPC codes under medium short frame transmission. This is of great significance to the practical application of LDPC codes