Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Abstract

Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a protograph-based analysis of terminated LDPCC codes to obtain an upper bound on the free distance growth rate of ensembles of periodically time-varying LDPCC codes. This bound is compared to a lower bound and evaluated numerically. It is found that, for a sufficiently large period, the bounds coincide. This approach is then extended to obtain bounds on the trapping set numbers, which define the size of the smallest, non-empty trapping sets, for these asymptotically good, periodically time-varying LDPCC code ensembles.

Details

Authors
External organisations
  • External Organization - Unknown
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatial coupling, LDPC codes, LDPC convolutional codes, trapping sets
Original languageEnglish
Title of host publication[Host publication title missing]
PublisherIEEE--Institute of Electrical and Electronics Engineers Inc.
Pages1096-1100
ISBN (Print)978-1-4577-0596-0
StatePublished - 2011
Peer-reviewedYes
EventIEEE International Symposium on Information Theory, 2011 - Saint Petersburg, Russian Federation

Publication series

Name
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory, 2011
Abbreviated titleISIT07
CountryRussian Federation
CitySaint Petersburg
Period2011/07/312011/08/05