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.

Window Decoding of Braided Convolutional Codes

På svenska

Author

Summary, in English

We consider a window decoding scheme for Braided Convolutional Codes (BCCs) based on the BCJR algorithm. We describe the principle of this decoding scheme and show that BCCs with window decoding exhibit excellent performance. The tradeoff between performance and decoding latency is examined and, to reduce decoding complexity, both uniform and nonuniform message passing schedules within the decoding window are considered. Finally, puncturing is employed to obtain rate-compatible code rates of 1/2 and 2/3 starting from a rate 1/3 example mother code. Simulation results show that, with nonuniform message passing and puncturing, near capacity performance can be maintained throughout the rate range considered with reasonable decoding complexity and no visible error floors.

Publishing year

2015

Language

English

Publication/Series

2015 IEEE Information Theory Workshop - Fall (ITW)

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatially coupled codes
  • braided codes
  • LDPC convolutional codes

Conference name

IEEE Information Theory Workshop (ITW), 2015

Conference date

2015-10-11 - 2015-10-15

Conference place

Jeju Island, Korea, Democratic People's Republic of

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 978-1-4673-7852-9