Braided Convolutional Codes: A New Class of Turbo-Like Codes

Wei Zhang; Michael Lentmaier; Kamil Zigangirov; Daniel J., Jr. Costello

doi:10.1109/TIT.2009.2034784

Braided Convolutional Codes: A New Class of Turbo-Like Codes

Wei Zhang, Michael Lentmaier, Kamil Zigangirov, Daniel J., Jr. Costello

Research output: Contribution to journal › Article › peer-review

37 Citations (SciVal)

291 Downloads (Pure)

Abstract

We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length, i.e., they are asymptotically good.

Original language	English
Pages (from-to)	316-331
Journal	IEEE Transactions on Information Theory
Volume	56
Issue number	1
DOIs	https://doi.org/10.1109/TIT.2009.2034784
Publication status	Published - 2010

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

turbo-like codes
iterative decoding
free distance
convolutional permutor
Braided convolutional codes
codes on graphs

Access to Document

10.1109/TIT.2009.2034784

BCC_FinalAccepted

Cite this

@article{1e551a004a664f3bbd17d8b5c517e573,

title = "Braided Convolutional Codes: A New Class of Turbo-Like Codes",

abstract = "We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length, i.e., they are asymptotically good.",

keywords = "turbo-like codes, iterative decoding, free distance, convolutional permutor, Braided convolutional codes, codes on graphs",

author = "Wei Zhang and Michael Lentmaier and Kamil Zigangirov and Costello, {Daniel J., Jr.}",

year = "2010",

doi = "10.1109/TIT.2009.2034784",

language = "English",

volume = "56",

pages = "316--331",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - Braided Convolutional Codes: A New Class of Turbo-Like Codes

AU - Zhang, Wei

AU - Lentmaier, Michael

AU - Zigangirov, Kamil

AU - Costello, Daniel J., Jr.

PY - 2010

Y1 - 2010

N2 - We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length, i.e., they are asymptotically good.

AB - We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length, i.e., they are asymptotically good.

KW - turbo-like codes

KW - iterative decoding

KW - free distance

KW - convolutional permutor

KW - Braided convolutional codes

KW - codes on graphs

U2 - 10.1109/TIT.2009.2034784

DO - 10.1109/TIT.2009.2034784

M3 - Article

VL - 56

SP - 316

EP - 331

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -

Braided Convolutional Codes: A New Class of Turbo-Like Codes

Abstract

Subject classification (UKÄ)

Keywords

Access to Document

Fingerprint

Cite this