The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

Summary, in English

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.

Publishing year

2011

Language

English

Pages

1096-1100

Publication/Series

2011 IEEE International Symposium on Information Theory Proceedings

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatial coupling
  • LDPC codes
  • LDPC convolutional codes
  • trapping sets

Conference name

IEEE International Symposium on Information Theory, 2011

Conference date

2011-07-31 - 2011-08-05

Conference place

Saint Petersburg, Russian Federation

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISSN: 2157-8117
  • ISSN: 2157-8095
  • ISBN: 978-1-4577-0596-0