Automatic Verification of GCD Constraint for Construction of Girth-Eight QC-LDPC Codes

Abstract

As a general method to yield constructions for quasi-cyclic (QC) low-density parity-check (LDPC) codes with girth eight, the greatest-common-divisor (GCD) framework heavily relies on verifying a type of inequalities, referred to as GCD constraints. An algorithm is developed in this letter to automatically verify GCD constraints without conducting any manual analysis, by bounding from above the GCD of a fixed integer and an integer in the form of linear function. As an application of the algorithm, a set of novel constructions based on GCD framework is proposed. From these new constructions, four novel bounds on the size of circulant permutation matrices (CPMs) are formulated, such that girth-eight QC-LDPC codes always exist for any CPM size greater than or equal to the bounds. The new bound for column weight of 6 slightly improves the existing best one, and those for column weights from 7 to 9 significantly strengthen the state-of-the-art ones by decreasing from essentially a cubic or biquadratic power of row weight to a quadratic power of row weight.