High Performance Full Diversity LDPC Codes Construction Algorithm
-
摘要: 块衰落信道上全分集LDPC的构造与性能分析成为近期研究的热点。ML译码算法下全分集LDPC码可以通过设计列满秩的校验子矩阵来实现。然而，基于ML准则的全分集码字，采用迭代译码算法时，不能保证全分集。因此，该文通过设计特定结构的校验矩阵，实现了在迭代译码算法下能取得全分集的LDPC码，分析了其密度演化过程。 在此基础上，进一步研究了全分集LDPC码字结构与性能的关系，提出了提高全分集LDPC码编码增益的方法。仿真结果表明，该文构造的LDPC码不仅能够取得全分集，并且具有较高的编码增益。Abstract: Full diversity Low Density Parity Check (LDPC) codes construction is the hot spot in LDPC field at present. Traditional construction algorithm designs column full rank check submatrix to realize full diversity LDPC codes under ML decoding algorithm. However, under BP decoding algorithm, the LDPC codes designed based on ML principle can not guarantee full diversity. In this paper, the construction method of full diversity LDPC codes under BP decoding algorithm is first put forward by changing the structure of parity check matrix, then, density propagetion process of full diversity LDPC codes is analyzed. Finally, the relationship between the structure of full diversity LDPC codes and the coding gain is researched, and the algorithm to improve coding gain is given. Simulation results show that the proposed algthriom can not only achieve full diversity, but also get better performace than random constructed LDPC codes.
-
Key words:
- Low Density Parity Check (LDPC) code /
- Block-fading /
- Full diversity /
- Diversity gain /
- Coding gain
-
计量
- 文章访问数: 2788
- HTML全文浏览量: 89
- PDF下载量: 598
- 被引次数: 0
下载:
