Anzeige
Erschienen in:
27.11.2019
On the search of smallest QC-LDPC code with girth six and eight
Erschienen in: Cryptography and Communications | Ausgabe 4/2020
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
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.