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.

Approaching Capacity with Asymptotically Regular LDPC Codes

På svenska

Author

Summary, in English

We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes vanishes as the termination length L increases, we call the codes asymptotically regular. The density evolution thresholds of these protographs are better than those of regular (J, K) block codes. Interestingly, this threshold improvement gets stronger with increasing node degrees (at a fixed rate) and it does not decay as L increases. Terminated convolutional protographs can also be derived from standard irregular protographs and may exhibit a significant threshold improvement.

Publishing year

2009

Language

English

Pages

173-177

Publication/Series

2009 Information Theory and Applications Workshop

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

Conference name

Information Theory and Applications Workshop (ITA), 2009

Conference date

2009-02-08 - 2009-02-13

Conference place

San Diego, CA, United Kingdom

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 978-1-4244-3990-4