论文部分内容阅读
文中提出了一种利用筛选算法寻找指数矩阵的新方法,其构造的准循环低密度校验码有两个主要的优点:一是可用简单线性移位寄存器完成编码;二是只需存储校验矩阵的指数矩阵,可节约很多存储空间。利用计算机能较快的搜索圈长为6,8,10,12的循环置换矩阵阶数的最小值p,搜出的这些p在理论上达到了Fossorier给出的最小下界。仿真结果表明构造的低密度校验码在加性高斯白噪声信道中BPSK调制下用和积迭代译码算法的误比特性能表现良好。
In this paper, we propose a new method to find the exponential matrix by using the filtering algorithm. The quasi-cyclic low-density parity-check code constructed by the algorithm has two main advantages: First, the coding can be done by a simple linear shift register; second, Matrix exponential matrix can save a lot of storage space. Using computer, we can search the minimum value p of order of cyclic permutation matrices with length of 6, 8, 10, and 12. The found p theoretically achieves the minimum bound given by Fossorier. The simulation results show that the constructed LDPC performs well in the bit error rate performance of BPSK modulation with additive product iterative decoding algorithm in additive white Gaussian noise channel.