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.

Braided Convolutional Codes - A Class of Spatially Coupled Turbo-Like Codes

På svenska

Author

Summary, in English

In this paper, we investigate the impact of spatial coupling on the thresholds of turbo-like codes. Parallel concatenated and serially concatenated convolutional codes as well as braided convolutional codes (BCCs) are compared by means of an exact density evolution (DE) analysis for the binary erasure channel (BEC). We propose two extensions of the original BCC ensemble to improve its threshold and demonstrate that their BP thresholds approach the maximum-a posteriori (MAP) threshold of the uncoupled ensemble. A comparison of the different ensembles shows that parallel concatenated ensembles can be outperformed by both serially concatenated and BCC ensembles, although they have the best BP thresholds in the uncoupled case.

Publishing year

2014

Language

English

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

  • turbo codes
  • braided codes
  • braided convolutional codes
  • LDPC convolutional codes
  • spatial coupling

Conference name

International Conference on Signal Processing and Communications (SPCOM)

Conference date

2014-07-22 - 2014-07-25

Conference place

Bangalore, India

Status

Published

Research group

  • Telecommunication Theory