Some variations of Tanner's construction for short length QC‐LDPC codes Article Swipe

PDF

Related Concepts

Low-density parity-check code Mathematics Girth (graph theory) Golomb coding Exponent Parity (physics) Discrete mathematics Frame (networking) Algorithm Decoding methods Telecommunications Computer science Linguistics Philosophy Particle physics Physics Artificial intelligence Image processing Image compression Image (mathematics)

Wonjun Kim , Hyunwoo Cho , Hong‐Yeop Song , Minkyu Song ·

YOU? · · 2024 · Open Access · · DOI: https://doi.org/10.1049/ell2.13088 · OA: W4391316854

This paper proposes a modification to Tanner's work for constructing girth‐8 quasi‐cyclic low‐density parity‐check codes. The main contribution of this paper is to use an arithmetic sequence at the leftmost column for the exponent matrix so that the lifting size is not necessarily restricted to the prime numbers. Two theorems on the lifting sizes that achieve girth at least 8 using this approach is also provided. This construction exhibits better frame error rate results to the modified 5G new radio (NR) low‐density parity‐check codes for lengths around 500. Also, this construction achieves better frame error rate performance results than the recently proposed one using the Golomb rulers at around frame error rate of 10 −6 .