Murali Krishnan, K and Singh, Rajdeep and Chandran, Sunil L and Shankar, Priti (2008) A Combinatorial Family of Near Regular LDPC Codes. In: IEEE International Symposium on Information Theory, 2007. ISIT 2007., 24-29 June 2007, Nice .
A_Combinatorial.pdf - Published Version
Restricted to Registered users only
Download (3880Kb) | Request a copy
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||17 Oct 2011 08:44|
|Last Modified:||17 Oct 2011 08:44|
Actions (login required)