On the search of smallest QC-LDPC code with girth six and eight
- 17 Downloads
In this paper, a new and simple method for the construction of Girth-6 (J,L) Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes is proposed. The method is further extended to the search of Girth-8 QC-LDPC codes with base matrices of order 3 × L and 4 × L. The construction is based on three different forms of exponent matrices and the parameters α, p, and q which satisfy the necessary algebraic conditions for a QC-LDPC code having girth 6 and 8. The proposed (J,L) QC-LDPC codes with girth at least six have optimal circulant permutation matrix (CPM) size for the cases where q = α + 1. Moreover, most of the girth-8 QC-LDPC codes searched by the proposed method have smaller CPM size than the existing codes of the same girth. In several cases, the method gives more than one exponent matrices for a code, as most of the existing methods cannot do so. Besides this, the proposed method not only search the QC-LDPC codes with smaller CPM size but also takes much less time than the existing search based methods to search code.
KeywordsQuasi-Cyclic Low-Density Parity-Check codes; Girth Circulant Permutation Matrix Exponent matrix
- 3.Berrou C., Glavieus A., Thitimajshima P.: Near shannon limit error-correcting coding and decoding: turbo-codes 1. IEEE International Conference on Communications. In: Proceeding of IEEE International Conference on Communications. (1993). 10.1109/icc.1993.397441Google Scholar
- 12.Tasdighi, A., Banihashemi, A.H., Sadeghi, M.R.: Symmetrical constructions for regular girth-8 QC-LDPC codes. IEEE Trans. Commun. 65(1), 14–22 (2017)Google Scholar