|
1. |
Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes
Li, Z.; Chen, L.; Zeng, L.; Lin, S.; Fong, W.;
Communications, IEEE Transactions on
Volume 53,
Issue 11,
Nov. 2005
Page(s):1973
-
1973
Abstract:
Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes 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 form from their parity-check matrices given in circulant form. Based on the systematic-circulation 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.
|
Cart
