QC-LDPC Codes From Difference Matrices and Difference Covering Arrays

• Published in: IEEE access Vol. 11; pp. 52141 - 52157
• Main Authors: Donovan, Diane M., Rao, Asha, Uskuplu, Elif, Yazici, E. Sule
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: 5G mobile communication; Arrays; Codes; combinatorial constructions; Complexity theory; Decoding; difference covering arrays; difference matrices; Encoding; Fields (mathematics); LDPC codes; Low density parity check codes; Lower bounds; Parity check codes; QC-LDPC codes; Sparse matrices
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2023.3279327

We give a framework that generalizes LDPC code constructions using transversal designs or related structures such as mutually orthogonal Latin squares. Our constructions offer a broader range of code lengths and codes rates. Similar earlier constructions rely on the existence of finite fields of order a power of a prime, which significantly restricts the functionality of the resulting codes. In contrast, the LDPC codes constructed here are based on difference matrices and difference covering arrays, structures that are available for any order <inline-formula> <tex-math notation="LaTeX">a </tex-math></inline-formula>, resulting in LDPC codes across a broader class of parameters, notably length <inline-formula> <tex-math notation="LaTeX">a(a-1) </tex-math></inline-formula>, for all even <inline-formula> <tex-math notation="LaTeX">a </tex-math></inline-formula>. Such values are not possible with earlier constructions, thus establishing the novelty of these new constructions. Specifically the codes constructed here satisfy the RC constraint and for <inline-formula> <tex-math notation="LaTeX">a </tex-math></inline-formula> odd, have length <inline-formula> <tex-math notation="LaTeX">a^{2} </tex-math></inline-formula> and rate <inline-formula> <tex-math notation="LaTeX">1-(4a-3)/a^{2} </tex-math></inline-formula>, and for <inline-formula> <tex-math notation="LaTeX">a </tex-math></inline-formula> even, length <inline-formula> <tex-math notation="LaTeX">a^{2}-a </tex-math></inline-formula> and rate at least <inline-formula> <tex-math notation="LaTeX">1-(4a-6)/(a^{2}-a) </tex-math></inline-formula>. When 3 does not divide <inline-formula> <tex-math notation="LaTeX">a </tex-math></inline-formula>, these LDPC codes have stopping distance at least 8. When <inline-formula> <tex-math notation="LaTeX">a </tex-math></inline-formula> is odd and both 3 and 5 do not divide <inline-formula> <tex-math notation="LaTeX">a </tex-math></inline-formula>, our construction delivers an infinite family of QC-LDPC codes with minimum distance at least 10. We also determine lower bounds for the stopping distance of the code. Further we include simulation results illustrating the performance of our codes. The BER and FER performance of our codes over AWGN (via simulation) is at least equivalent to codes constructed previously.