High-Rate QC LDPC Codes of Short and Moderate Length with Good Girth Profile
Irregular QC LDPC codes with parity-check matrices having different degree distributions are studied. A new algorithm for finding regular and irregular QC LDPC codes with a good girth profile as well as a good sliding-window girth is presented. As examples, simulation results for QC LDPC codes with good girth profile, rate R=4/5, and lengths about 1000, 2000, and 4000, constructed from base matrices with proper degree distributions are given. Their simulated BER and FER performances for belief propagation decoding are compared with the best previously known irregular QC LDPC codes of the same rate and length. It is shown that the constructed codes outperform the best previously known codes of same rate and lengths.
- Technology and Engineering
7th International Symposium on Turbo Codes & Iterative Information Processing
- Information Theory