Software for Analyzing Cycles in QC LDPC Code Protographs

The paper is devoted to an overview of the designed software that allows you to adjust the presence of cycles with certain parameters in Tanner graphs. The key indicator in the analysis of cycles is the number of unique block checks, the presence of which is determined by the route in the protograph. To verify the correctness of the created modification of the developed specialized software, a set of programs has been prepared that solve the problem of analyzing and classifying the cycles available in the Tanner graph. The method of detecting routes in protographs of quasi-cyclic LDPC codes has also been improved both in terms of computational costs and memory used.