Advanced

Combinatorial Optimization for Improving QC LDPC codes performance

Bocharova, Irina LU ; Kudryashov, Boris LU and Johannesson, Rolf LU (2013) IEEE International Symposium on Information Theory, 2013 In IEEE International Symposium on Information Theory (ISIT) p.2651-2655
Abstract
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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
IEEE International Symposium on Information Theory (ISIT)
pages
5 pages
conference name
IEEE International Symposium on Information Theory, 2013
external identifiers
  • scopus:84890403768
ISSN
2157-8095
2157-8117
DOI
10.1109/ISIT.2013.6620707
language
English
LU publication?
yes
id
79f3339e-df46-4772-bc00-4c47b3fd6921 (old id 4390465)
date added to LUP
2014-04-07 13:26:10
date last changed
2018-05-29 11:59:14
@inproceedings{79f3339e-df46-4772-bc00-4c47b3fd6921,
  abstract     = {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       = {Bocharova, Irina and Kudryashov, Boris and Johannesson, Rolf},
  booktitle    = {IEEE International Symposium on Information Theory (ISIT)},
  issn         = {2157-8095},
  language     = {eng},
  pages        = {2651--2655},
  title        = {Combinatorial Optimization for Improving QC LDPC codes performance},
  url          = {http://dx.doi.org/10.1109/ISIT.2013.6620707},
  year         = {2013},
}