Details

Autor(en) / Beteiligte

• Li, Huaan
• Xu, Hengzhou
• Chen, Chao
• Bai, Baoming

Titel

Efficient Construction of Quasi-Cyclic LDPC Codes With Multiple Lifting Sizes

Ist Teil von

• IEEE communications letters, 2024-04, Vol.28 (4), p.754-758

Ort / Verlag

New York: IEEE

Erscheinungsjahr

2024

Quelle

IEEE Electronic Library (IEL)

Beschreibungen/Notizen

• In this letter, we present an efficient method for constructing a family of quasi-cyclic low-density parity-check (QC-LDPC) codes specified only by one single exponent matrix that can support multiple lifting sizes. Our method adopts the small-lifting-size-first design strategy and the resulting exponent matrix of larger lifting size has non-decreasing girth. Numerical results show that all constituent codes can perform as well as (outperform) the CCSDS (5G) LDPC codes over the AWGN channel with the iterative decoding algorithms. This fact demonstrates the feasibility and validity of our proposed method and makes it competitive in some applications, e.g., enhancing short and medium-length LDPC codes to support longer length.