论文部分内容阅读
主要提出一种新的计算规则LDPC(low-density parity-check)码的最小距离下界的方法。该方法是基于LDPC码的每个变量节点的独立树进行构造LDPC码。与随机构造的LDPC码和用PEG方法构造的方法比较,这个新的构造方法得到了更大的围长和最小距离下界。在AWGN信道中,在码长N=1 008和N=1 512时进行Matlab仿真,仿真结果表明随着信噪比的增加此方法构造的LDPC码有优异的误码率性能。
This paper proposes a new method to calculate the minimum distance lower bound of LDPC (low-density parity-check) codes. This method is based on the independent tree of each variable node of the LDPC code to construct the LDPC code. Compared with the randomly constructed LDPC code and the method constructed by the PEG method, the new construction method obtains a larger bound of the girth and the minimum distance. In the AWGN channel, Matlab simulation is carried out with code length N = 1 008 and N = 1 512, and the simulation results show that the LDPC codes constructed by this method have excellent BER performance with the increase of signal-to-noise ratio.