Coset-based QC-LDPC codes without small cycles
Coset-based QC-LDPC codes without small cycles
复制标题
DOI：
10.1049/el.2014.2121
复制
发表时间：
2014-10
影响因子：
1.1
通讯作者：
Juhua Wang;Guohua Zhang;Quan Zhou
中科院分区：
文献类型：
--
作者：
Juhua Wang;Guohua Zhang;Quan Zhou
提出了一种基于陪集概念的构造(3，L)无小环准循环低密度奇偶校验码的简单有效的搜索方法。与随机搜索法相比，新方法发现大周长码的机会显著增加。与Tanner的构造方法相比，该方法在行重L的选择上具有更大的灵活性。与已有的构造方法相比，一些新码的构造长度最短。仿真结果表明，这种长度适中的新码在加性高斯白噪声信道中具有良好的性能。
A simple and efficient search method based on the coset concept is proposed to construct (3, L) quasi-cyclic low-density parity-check (QC-LDPC) codes without small cycles. Compared with the random search method, the chance to find large-girth codes is remarkably increased for the new method. Compared with Tanner's construction, the proposed method is much more flexible in the selection of row weight L. Some new codes are constructed with the shortest lengths compared with those constructed by the existing well-known methods. Simulation results show that the novel codes with moderate length perform well in the additive white Gaussian noise channel.