Recursive construction of quasi-cyclic cycle LDPC codes based on replacement products

Abstract

Product replacement gives a simple approach for code construction. This paper investigates the use of replacement product graphs for the recursive construction of QC cycle LDPC codes. It is proved that the QC cycle LDPC codes constructed by our approach are of girth 6. Simulation results show that QC cycle LDPC codes constructed by the replacement product perform well over the AWGN channel.