Open AccessConstruction of girth‐eight QC‐LDPC codes from arithmetic progression sequence with large column weight
Author(s) -
Zhang Yi,
Da Xinyu
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2015.0389
Subject(s) - low density parity check code , circulant matrix , mathematics , girth (graph theory) , permutation matrix , permutation (music) , turbo code , combinatorics , discrete mathematics , code (set theory) , concatenated error correction code , forward error correction , column (typography) , block code , arithmetic , algorithm , decoding methods , computer science , physics , set (abstract data type) , acoustics , programming language , geometry , connection (principal bundle)
For any row weight L , a novel class of (8, L ) quasi‐cyclic low‐density parity‐check (QC‐LDPC) codes is deterministically constructed with girth eight. Compared with a similar construction, the proposed (7, L ) and (8, L ) QC‐LDPC codes exist for any circulant permutation matrix of size P ≥ ( L − 1)( L 2 + 3 L /4 + 3/4) + 1 and P ≥ ( L − 1)( L 2 + 3 L /4 + 7/4) +1, which remarkably improve the existing bounds of ( L − 1)( L 2 + L ) +1 and ( L − 1)( L 2 + L + 1) +1, respectively. Moreover, for any column weight J , any row weight L and any common difference, a construction for ( J , L ) QC‐LDPC codes with girth eight is also proposed. This construction has high flexibility with respect to the design of code rate and code length. Simulation results show that the novel codes with moderate lengths perform well in the additive white Gaussian noise channel.