论文部分内容阅读
该课题研究构造了纠错能力强、编译码复杂度低的中短码长的率匹配多进制LDPC码。提出了一种校验位高效编码删余算法,以得到高性能的多进制RC-LDPC码。该删余算法以设计的高性能中短码长、中等码率(1/2码率)的多进制LDPC母码为基础,采用高效的结构化编码删余算法,实现比较宽的速率范围(例如1/10到9/10)内设计高性能的纠错码。仿真结果表明,此算法性能优于传统的随机删余和节点分组与排序删余算法。
The research of this paper constructs rate-matching multi-ary LDPC codes with strong error-correcting ability and low compilation and decoding complexity. A parity bit efficient coding and puncturing algorithm is proposed to obtain high performance multi-ary RC-LDPC codes. The punctured algorithm is based on designed high-performance medium-short code length and medium code rate (1/2 code rate) LDPC codes, and adopts an efficient structured coding and puncturing algorithm to achieve a relatively wide speed range (For example, 1/10 to 9/10) to design high-performance error correction code. Simulation results show that this algorithm outperforms the traditional random puncturing and node grouping and sorting and puncturing algorithms.