Efficient encoding of quasi-cyclic low-density parity-check codes
Efficient encoding of quasi-cyclic low-density parity-check codes
复制标题
DOI：
10.1109/tcomm.2005.858628
复制
发表时间：
2005-11
影响因子：
8.3
通讯作者：
Zongwang Li;Lei Chen;L. Zeng;Shu Lin;W. Fong
中科院分区：
文献类型：
--
作者：
Zongwang Li;Lei Chen;L. Zeng;Shu Lin;W. Fong
准循环（QC）低密度奇偶校验检查（LDPC）代码形成了LDPC代码的重要子类。这些代码比其他类型的LDPC代码具有编码优势。本文讨论了QC-LDPC代码有效编码的问题。提出了两种方法，以从其奇偶校验检查矩阵（以循环形式给出），以系统循环（SC）形式找到QC-LDPC代码的发电机矩阵。基于QC-LDPC代码的发电机矩阵的SC形式，设计了使用简单移位寄存器的各种类型的编码电路。结果表明，QC-LDPC代码的编码复杂性与串行编码代码的奇偶校验位数量和高速并行编码的代码长度成正比。
Quasi-cyclic (QC) low-density parity-check (LDPC) codes form an important subclass of LDPC codes. These codes have encoding advantage over other types of LDPC codes. This paper addresses the issue of efficient encoding of QC-LDPC codes. Two methods are presented to find the generator matrices of QC-LDPC codes in systematic-circulant (SC) form from their parity-check matrices, given in circulant form. Based on the SC form of the generator matrix of a QC-LDPC code, various types of encoding circuits using simple shift registers are devised. It is shown that the encoding complexity of a QC-LDPC code is linearly proportional to the number of parity bits of the code for serial encoding, and to the length of the code for high-speed parallel encoding.