Home > Research > Publications & Outputs > The Augmented State Diagram and its Application...
View graph of relations

The Augmented State Diagram and its Application to Convolutional and Turbo Codes

Research output: Contribution to journalJournal article

Published

Standard

The Augmented State Diagram and its Application to Convolutional and Turbo Codes. / Chatzigeorgiou, Ioannis; Rodrigues, Miguel R. D.; Wassell, Ian J.; Carrasco, Rolando A.

In: IEEE Transactions on Communications, Vol. 57, No. 7, 07.2009, p. 1948-1958.

Research output: Contribution to journalJournal article

Harvard

Chatzigeorgiou, I, Rodrigues, MRD, Wassell, IJ & Carrasco, RA 2009, 'The Augmented State Diagram and its Application to Convolutional and Turbo Codes' IEEE Transactions on Communications, vol. 57, no. 7, pp. 1948-1958. https://doi.org/10.1109/TCOMM.2009.07.070344

APA

Chatzigeorgiou, I., Rodrigues, M. R. D., Wassell, I. J., & Carrasco, R. A. (2009). The Augmented State Diagram and its Application to Convolutional and Turbo Codes. IEEE Transactions on Communications, 57(7), 1948-1958. https://doi.org/10.1109/TCOMM.2009.07.070344

Vancouver

Chatzigeorgiou I, Rodrigues MRD, Wassell IJ, Carrasco RA. The Augmented State Diagram and its Application to Convolutional and Turbo Codes. IEEE Transactions on Communications. 2009 Jul;57(7):1948-1958. https://doi.org/10.1109/TCOMM.2009.07.070344

Author

Chatzigeorgiou, Ioannis ; Rodrigues, Miguel R. D. ; Wassell, Ian J. ; Carrasco, Rolando A. / The Augmented State Diagram and its Application to Convolutional and Turbo Codes. In: IEEE Transactions on Communications. 2009 ; Vol. 57, No. 7. pp. 1948-1958.

Bibtex

@article{e53d0708331c4df384b4cac6a26a82df,
title = "The Augmented State Diagram and its Application to Convolutional and Turbo Codes",
abstract = "Convolutional block codes, which are commonly used as constituent codes in turbo code configurations, accept a block of information bits as input rather than a continuous stream of bits. In this paper, we propose a technique for the calculation of the transfer function of convolutional block codes, both punctured and nonpunctured. The novelty of our approach lies in the augmentation of the conventional state diagram, which allows the enumeration of all codeword sequences of a convolutional block code. In the case of a turbo code, we can readily calculate an upper bound to its bit error rate performance if the transfer function of each constituent convolutional block code has been obtained. The bound gives an accurate estimate of the error floor of the turbo code and, consequently, our method provides a useful analytical tool for determining constituent codes or identifying puncturing patterns that improve the bit error rate performance of a turbo code, at high signal-to-noise ratios.",
keywords = "Turbo codes, convolutional codes, puncturing, transfer function, state diagram, DISTANCE, SCHEMES",
author = "Ioannis Chatzigeorgiou and Rodrigues, {Miguel R. D.} and Wassell, {Ian J.} and Carrasco, {Rolando A.}",
year = "2009",
month = "7",
doi = "10.1109/TCOMM.2009.07.070344",
language = "English",
volume = "57",
pages = "1948--1958",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

RIS

TY - JOUR

T1 - The Augmented State Diagram and its Application to Convolutional and Turbo Codes

AU - Chatzigeorgiou, Ioannis

AU - Rodrigues, Miguel R. D.

AU - Wassell, Ian J.

AU - Carrasco, Rolando A.

PY - 2009/7

Y1 - 2009/7

N2 - Convolutional block codes, which are commonly used as constituent codes in turbo code configurations, accept a block of information bits as input rather than a continuous stream of bits. In this paper, we propose a technique for the calculation of the transfer function of convolutional block codes, both punctured and nonpunctured. The novelty of our approach lies in the augmentation of the conventional state diagram, which allows the enumeration of all codeword sequences of a convolutional block code. In the case of a turbo code, we can readily calculate an upper bound to its bit error rate performance if the transfer function of each constituent convolutional block code has been obtained. The bound gives an accurate estimate of the error floor of the turbo code and, consequently, our method provides a useful analytical tool for determining constituent codes or identifying puncturing patterns that improve the bit error rate performance of a turbo code, at high signal-to-noise ratios.

AB - Convolutional block codes, which are commonly used as constituent codes in turbo code configurations, accept a block of information bits as input rather than a continuous stream of bits. In this paper, we propose a technique for the calculation of the transfer function of convolutional block codes, both punctured and nonpunctured. The novelty of our approach lies in the augmentation of the conventional state diagram, which allows the enumeration of all codeword sequences of a convolutional block code. In the case of a turbo code, we can readily calculate an upper bound to its bit error rate performance if the transfer function of each constituent convolutional block code has been obtained. The bound gives an accurate estimate of the error floor of the turbo code and, consequently, our method provides a useful analytical tool for determining constituent codes or identifying puncturing patterns that improve the bit error rate performance of a turbo code, at high signal-to-noise ratios.

KW - Turbo codes

KW - convolutional codes

KW - puncturing

KW - transfer function

KW - state diagram

KW - DISTANCE

KW - SCHEMES

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

U2 - 10.1109/TCOMM.2009.07.070344

DO - 10.1109/TCOMM.2009.07.070344

M3 - Journal article

VL - 57

SP - 1948

EP - 1958

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 7

ER -