Construction of quasi cyclic LDPC with ACE constraint

Abstract

In this paper, LDPC code structure and decoder implementation is reviewed. The effect of graph connectivity on LDPC performance is analyzed. The metric of ACE (approximate cycle EMD) in code construction avoids small trapping sets by emphasizing the connectivity. A construction algorithm with ACE constraint is proposed which maximize the girth and stopping sets in a best effort way. Simulation results justify the efficiency of the algorithm.