Advanced

Window Decoding of Braided Convolutional Codes

Zhu, Min; Mitchell, David G.M.; Lentmaier, Michael LU ; Costello Jr., Daniel J. and Bai, Baoming (2015) IEEE Information Theory Workshop (ITW), 2015 In 2015 IEEE Information Theory Workshop - Fall (ITW)
Abstract
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... (More)
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. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
spatially coupled codes, braided codes, LDPC convolutional codes
in
2015 IEEE Information Theory Workshop - Fall (ITW)
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE Information Theory Workshop (ITW), 2015
external identifiers
  • Scopus:84962766160
DOI
10.1109/ITWF.2015.7360751
language
English
LU publication?
yes
id
e8863b9a-9278-44ee-8b2e-4fc1bac0dba9 (old id 8081425)
date added to LUP
2015-10-21 09:14:50
date last changed
2016-10-13 04:36:51
@misc{e8863b9a-9278-44ee-8b2e-4fc1bac0dba9,
  abstract     = {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.},
  author       = {Zhu, Min and Mitchell, David G.M. and Lentmaier, Michael and Costello Jr., Daniel J. and Bai, Baoming},
  keyword      = {spatially coupled codes,braided codes,LDPC convolutional codes},
  language     = {eng},
  publisher    = {ARRAY(0x99e37d0)},
  series       = {2015 IEEE Information Theory Workshop - Fall (ITW)},
  title        = {Window Decoding of Braided Convolutional Codes},
  url          = {http://dx.doi.org/10.1109/ITWF.2015.7360751},
  year         = {2015},
}