基于有限域的准循环LDPC码构造
lgebraic Constructions of Quasi-Cyclic LDPC Codes Based on Finite Fields
本文介绍了两种全新的基于有限域的准循环LDPC码构造方法。这两种构造分别基于本原元和乘群中的生成元进行。码构造通过将基矩阵扩展成为循环移位矩阵阵列实现。与此同时，掩蔽操作也可同上述的两种构造方法结合，产生不同码率与度分布的码字。基于这种方法构造的LDPC码在AWGN信道中采用迭代译码算法能取得很好的译码效果。
his paper introduces two new algebraic constructions of quasi-cyclic LDPC codes based on finite fields. Constructions of regular or near-regular codes based on primitive elements and subgroups of a multiplicative group are introduced. The constructions are achieved by dispersing base matrices into arrays of CPMs. Masking can also be applied to all the two resultant parity check matrices for codes with various rates and degree distributions. The codes constructed based on the new approaches perform well with iterative decoding over AWGN channel.
张瑞
通信
通信与信息系统循环置换矩阵迭代译码低密度奇偶校验码定位向量准循环码
rray dispersioncirculant permutation matrix (CPM)iterative decodinglow-density parity-check (LDPC) codeslocation-vectorquasi-cyclic codes
张瑞.基于有限域的准循环LDPC码构造[EB/OL].(2014-11-25)[2025-08-10].http://www.paper.edu.cn/releasepaper/content/201411-468.点此复制
评论