New Perspectives on Braided Convolutional Codes

Daniel J. Costello, Jr.; Michael Lentmaier; David G. M. Mitchell

doi:10.1109/ISTC.2016.7593145

New Perspectives on Braided Convolutional Codes

Daniel J. Costello, Jr., Michael Lentmaier, David G. M. Mitchell

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

426 Downloads (Pure)

Abstract

Braided convolutional codes (BCCs) are a type of parallel-concatenated convolutional code in which the parity outputs of one component encoder are fed back and used as inputs to the other component encoder at the succeeding time unit. In this paper, we review the published results on BCCs that have appeared in the literature over the past ten years and present a unified view of BCCs in the context of other types of turbo-like codes. We also include some recent results on iterative decoding thresholds for BCCs, weight enumerators and distance growth rates, window decoding for low latency operation, and rate-compatible BCCs for high-rate applications.

Original language	English
Title of host publication	Proc. 9th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)
Place of Publication	Brest, France
Number of pages	6
DOIs	https://doi.org/10.1109/ISTC.2016.7593145
Publication status	Published - 2016 Sept 5
Event	International Symposium on Turbo Codes & Iterative Information Processing - Brest, France Duration: 2016 Sept 5 → 2016 Sept 9 Conference number: 9 https://conferences.telecom-bretagne.eu/turbocodes/

Conference

Conference	International Symposium on Turbo Codes & Iterative Information Processing
Abbreviated title	ISTC
Country/Territory	France
City	Brest
Period	2016/09/05 → 2016/09/09
Internet address	https://conferences.telecom-bretagne.eu/turbocodes/

Bibliographical note

invited paper

Subject classification (UKÄ)

Telecommunications

Free keywords

braided codes, spatially coupled codes, convolutional codes, staircase codes, turbo codes

Access to Document

10.1109/ISTC.2016.7593145

CLM_ISTC2016_Final

Cite this

@inproceedings{4a07f7b3152c459a8821ecccb0d6754b,

title = "New Perspectives on Braided Convolutional Codes",

abstract = "Braided convolutional codes (BCCs) are a type of parallel-concatenated convolutional code in which the parity outputs of one component encoder are fed back and used as inputs to the other component encoder at the succeeding time unit. In this paper, we review the published results on BCCs that have appeared in the literature over the past ten years and present a unified view of BCCs in the context of other types of turbo-like codes. We also include some recent results on iterative decoding thresholds for BCCs, weight enumerators and distance growth rates, window decoding for low latency operation, and rate-compatible BCCs for high-rate applications.",

keywords = "braided codes, spatially coupled codes, convolutional codes, staircase codes, turbo codes",

author = "{Costello, Jr.}, {Daniel J.} and Michael Lentmaier and Mitchell, {David G. M.}",

note = "invited paper; International Symposium on Turbo Codes & Iterative Information Processing, ISTC ; Conference date: 05-09-2016 Through 09-09-2016",

year = "2016",

month = sep,

day = "5",

doi = "10.1109/ISTC.2016.7593145",

language = "English",

booktitle = "Proc. 9th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)",

url = "https://conferences.telecom-bretagne.eu/turbocodes/",

}

TY - GEN

T1 - New Perspectives on Braided Convolutional Codes

AU - Costello, Jr., Daniel J.

AU - Lentmaier, Michael

AU - Mitchell, David G. M.

N1 - Conference code: 9

PY - 2016/9/5

Y1 - 2016/9/5

N2 - Braided convolutional codes (BCCs) are a type of parallel-concatenated convolutional code in which the parity outputs of one component encoder are fed back and used as inputs to the other component encoder at the succeeding time unit. In this paper, we review the published results on BCCs that have appeared in the literature over the past ten years and present a unified view of BCCs in the context of other types of turbo-like codes. We also include some recent results on iterative decoding thresholds for BCCs, weight enumerators and distance growth rates, window decoding for low latency operation, and rate-compatible BCCs for high-rate applications.

AB - Braided convolutional codes (BCCs) are a type of parallel-concatenated convolutional code in which the parity outputs of one component encoder are fed back and used as inputs to the other component encoder at the succeeding time unit. In this paper, we review the published results on BCCs that have appeared in the literature over the past ten years and present a unified view of BCCs in the context of other types of turbo-like codes. We also include some recent results on iterative decoding thresholds for BCCs, weight enumerators and distance growth rates, window decoding for low latency operation, and rate-compatible BCCs for high-rate applications.

KW - braided codes, spatially coupled codes, convolutional codes, staircase codes, turbo codes

U2 - 10.1109/ISTC.2016.7593145

DO - 10.1109/ISTC.2016.7593145

M3 - Paper in conference proceeding

BT - Proc. 9th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)

CY - Brest, France

T2 - International Symposium on Turbo Codes & Iterative Information Processing

Y2 - 5 September 2016 through 9 September 2016

ER -

New Perspectives on Braided Convolutional Codes

Abstract

Conference

Bibliographical note

Subject classification (UKÄ)

Free keywords

Access to Document

Fingerprint

Cite this