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.

Asymptotic Distance and Convergence Analysis of Braided Protograph Convolutional Codes

På svenska

Author

Summary, in English

We analyze a class of LDPC convolutional codes that are constructed from tightly braided convolutional base codes by a lifting procedure. For these braided protograph convolutional codes, we show that the distances grow linearly with the constraint length, and we present lower bounds on their asymptotic segment distance and free distance as well as on the asymptotic minimum distance of their tail-biting versions. With some constraints imposed on the lifting permutations, braided protograph convolutional codes can also be decoded as turbo-like codes by iterative application of the BCJR algorithm. For this case, we derive an explicit upper-bound on the asymptotic decoding error probability as a function of the number of iterations.

Publishing year

2008

Language

English

Pages

1073-1080

Publication/Series

[Host publication title missing]

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • braided codes
  • braided convolutional codes
  • spatial coupling

Conference name

Annual Allerton Conference on Communication, Control and Computing (Allerton), 2008

Conference date

2008-09-23 - 2008-09-26

Conference place

Monticello, IL, United States

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 978-1-4244-2925-7