A Combinatorial Family of Near Regular LDPC Codes

Abstract-- An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes are near regular in the sense that the degree of a left/right vertex is allowed to differ by at most one from the average. The construction yields in quadratic time complexity an asymptotic code family with provable lower bounds on the rate and the girth for a given choice of block length and average degree. The construction gives flexibility in the choice of design parameters of the code like rate, girth and average degree. Performance simulations of iterative decoding algorithm for the AWGN channel on codes designed using the method demonstrate that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.

• Type: Journal
• Year: 2006
• Where: CORR
• Authors: K. Murali Krishnan, Rajdeep Singh, L. Sunil Chandran, Priti Shankar
• Keywords: Average Degree, Combinatorial Tanner Graph, CORR 2006, Education, Low Density Parity