Minimum distance bounds for multiple-serially concatenated code ensembles

Christian Koller; Jörg Kliewer; Kamil S. Zigangirov; Daniel J. Costello

doi:10.1109/ISIT.2008.4595316

Minimum distance bounds for multiple-serially concatenated code ensembles

Christian Koller, Jörg Kliewer, Kamil S. Zigangirov, Daniel J. Costello

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

Abstract

It has recently been shown that the minimum distance of the ensemble of repeat multiple accumulate codes grows linearly with block length. In this paper, we present a method to obtain the distance growth rate coefficient of multipleserially concatenated code ensembles and determine the growth rate coefficient of the rate 1/2 double-serially concatenated code consisting of an outer memory one convolutional code followed by two accumulators. We compare both the growth rate of the minimum distance, as well as the convergence behavior, of this code with rate 1/2 repeat multiple accumulate codes, and we show that repeat multiple accumulate codes have better minimum distance growth but worse performance in terms of convergence.

Original language	English (US)
Title of host publication	Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages	1888-1892
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2008.4595316
State	Published - 2008
Externally published	Yes
Event	2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada Duration: Jul 6 2008 → Jul 11 2008

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Other

Other	2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/Territory	Canada
City	Toronto, ON
Period	7/6/08 → 7/11/08

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2008.4595316

Cite this

Koller, C., Kliewer, J., Zigangirov, K. S., & Costello, D. J. (2008). Minimum distance bounds for multiple-serially concatenated code ensembles. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 1888-1892). Article 4595316 (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4595316

@inproceedings{0390ae748e604744aaabe941846f01e5,

title = "Minimum distance bounds for multiple-serially concatenated code ensembles",

abstract = "It has recently been shown that the minimum distance of the ensemble of repeat multiple accumulate codes grows linearly with block length. In this paper, we present a method to obtain the distance growth rate coefficient of multipleserially concatenated code ensembles and determine the growth rate coefficient of the rate 1/2 double-serially concatenated code consisting of an outer memory one convolutional code followed by two accumulators. We compare both the growth rate of the minimum distance, as well as the convergence behavior, of this code with rate 1/2 repeat multiple accumulate codes, and we show that repeat multiple accumulate codes have better minimum distance growth but worse performance in terms of convergence.",

author = "Christian Koller and J{\"o}rg Kliewer and Zigangirov, {Kamil S.} and Costello, {Daniel J.}",

year = "2008",

doi = "10.1109/ISIT.2008.4595316",

language = "English (US)",

isbn = "9781424422579",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1888--1892",

booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

note = "2008 IEEE International Symposium on Information Theory, ISIT 2008 ; Conference date: 06-07-2008 Through 11-07-2008",

}

Koller, C, Kliewer, J, Zigangirov, KS & Costello, DJ 2008, Minimum distance bounds for multiple-serially concatenated code ensembles. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4595316, IEEE International Symposium on Information Theory - Proceedings, pp. 1888-1892, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 7/6/08. https://doi.org/10.1109/ISIT.2008.4595316

Minimum distance bounds for multiple-serially concatenated code ensembles. / Koller, Christian; Kliewer, Jörg; Zigangirov, Kamil S. et al.
Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 1888-1892 4595316 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Minimum distance bounds for multiple-serially concatenated code ensembles

AU - Koller, Christian

AU - Kliewer, Jörg

AU - Zigangirov, Kamil S.

AU - Costello, Daniel J.

PY - 2008

Y1 - 2008

N2 - It has recently been shown that the minimum distance of the ensemble of repeat multiple accumulate codes grows linearly with block length. In this paper, we present a method to obtain the distance growth rate coefficient of multipleserially concatenated code ensembles and determine the growth rate coefficient of the rate 1/2 double-serially concatenated code consisting of an outer memory one convolutional code followed by two accumulators. We compare both the growth rate of the minimum distance, as well as the convergence behavior, of this code with rate 1/2 repeat multiple accumulate codes, and we show that repeat multiple accumulate codes have better minimum distance growth but worse performance in terms of convergence.

AB - It has recently been shown that the minimum distance of the ensemble of repeat multiple accumulate codes grows linearly with block length. In this paper, we present a method to obtain the distance growth rate coefficient of multipleserially concatenated code ensembles and determine the growth rate coefficient of the rate 1/2 double-serially concatenated code consisting of an outer memory one convolutional code followed by two accumulators. We compare both the growth rate of the minimum distance, as well as the convergence behavior, of this code with rate 1/2 repeat multiple accumulate codes, and we show that repeat multiple accumulate codes have better minimum distance growth but worse performance in terms of convergence.

UR - http://www.scopus.com/inward/record.url?scp=52349111814&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52349111814&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4595316

DO - 10.1109/ISIT.2008.4595316

M3 - Conference contribution

AN - SCOPUS:52349111814

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1888

EP - 1892

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -

Minimum distance bounds for multiple-serially concatenated code ensembles

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this