Combinatorial Optimization for Improving QC LDPC codes performance

Summary, in English

Techniques for searching for good quasi-cyclic (QC) LDPC block codes of short and moderate lengths which are suitable for practical purposes are studied. To facilitate implementations only codes whose parity-check matrices having bidiagonal structure of their submatrices and consequently having low encoding complexity are considered. The problem of finding QC LDPC codes with the near-optimum frame or bit error rate performance is split into two independent steps: searching for the near-optimum column degree distribution of the parity-check matrix together with the best base matrix for this degree distribution and searching for the near-optimum labeling of the chosen base matrix. Sets of parameters and criteria for both steps are introduced and discussed. They allow further reduction of the search complexity without significant loss of the search optimality. New QC LDPC block codes of various code rates are obtained and their BER and FER performances are compared with those of the LDPC block codes as well as the turbo codes defined in the IEEE 802.16 WiMAX standard.

• Author: Irina Bocharova; Boris Kudryashov; Rolf Johannesson
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2013
• Language: English
• Pages: 2651-2655
• Publication/Series: IEEE International Symposium on Information Theory (ISIT)
• Links: http://dx.doi.org/10.1109/ISIT.2013.6620707
• Document type: Conference paper
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Conference name: IEEE International Symposium on Information Theory, 2013
• Conference date: 2013-07-07 - 2013-07-12
• Conference place: Istanbul, Turkey
• Status: Published
• ISBN/ISSN/Other: ISSN: 2157-8117; ISSN: 2157-8095