Error Probability Bounds for Trellis Coded Modulation over Sequence Dependent Channels

Ikuo OKA; Ezio BIGLIERI

Error Probability Bounds for Trellis Coded Modulation over Sequence Dependent Channels

Ikuo OKA, Ezio BIGLIERI

Full Text Views

0

Share
Cite this

Summary :

We consider the computation of an upper bound to error probability in Trellis-Coded Modulation (TCM) schemes in sequence dependent channnels. In its most common form, the pairwise-state" technique is applicable to this class of channels. However, it entails a degree of complexity that may not acceptable, because the dimension of the matrices involved in pairwise-state calculations is the square of the number of states, and the number of states, say N, equals the product of the code states and of the channel states. In this paper, we derive an error probability bound based on a computational technique which avoids the consideration of N²N² matrices. It is based on the computaion of the transfer function of a graph with N1 nodes, and whose branch labels are NN matrices rather than scalars. we also describe some looser bounds which simplify the computation of error probability over intersymbol interference (ISI) channels, and show numerical results of the methods applied to trellis coded 16-QAM with 2-symbol ISI.

Publication: IEICE TRANSACTIONS on transactions Vol.E72-E No.4 pp.375-383

Publication Date: 1989/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Communication Theory

Authors

Ikuo OKA
Ezio BIGLIERI

Keyword

Cite this

Copy

Ikuo OKA, Ezio BIGLIERI, "Error Probability Bounds for Trellis Coded Modulation over Sequence Dependent Channels" in IEICE TRANSACTIONS on transactions, vol. E72-E, no. 4, pp. 375-383, April 1989, doi: .
Abstract: We consider the computation of an upper bound to error probability in Trellis-Coded Modulation (TCM) schemes in sequence dependent channnels. In its most common form, the pairwise-state" technique is applicable to this class of channels. However, it entails a degree of complexity that may not acceptable, because the dimension of the matrices involved in pairwise-state calculations is the square of the number of states, and the number of states, say N, equals the product of the code states and of the channel states. In this paper, we derive an error probability bound based on a computational technique which avoids the consideration of N²N² matrices. It is based on the computaion of the transfer function of a graph with N1 nodes, and whose branch labels are NN matrices rather than scalars. we also describe some looser bounds which simplify the computation of error probability over intersymbol interference (ISI) channels, and show numerical results of the methods applied to trellis coded 16-QAM with 2-symbol ISI.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e72-e_4_375/_p

Copy

@ARTICLE{e72-e_4_375,
author={Ikuo OKA, Ezio BIGLIERI, },
journal={IEICE TRANSACTIONS on transactions},
title={Error Probability Bounds for Trellis Coded Modulation over Sequence Dependent Channels},
year={1989},
volume={E72-E},
number={4},
pages={375-383},
abstract={We consider the computation of an upper bound to error probability in Trellis-Coded Modulation (TCM) schemes in sequence dependent channnels. In its most common form, the pairwise-state" technique is applicable to this class of channels. However, it entails a degree of complexity that may not acceptable, because the dimension of the matrices involved in pairwise-state calculations is the square of the number of states, and the number of states, say N, equals the product of the code states and of the channel states. In this paper, we derive an error probability bound based on a computational technique which avoids the consideration of N²N² matrices. It is based on the computaion of the transfer function of a graph with N1 nodes, and whose branch labels are NN matrices rather than scalars. we also describe some looser bounds which simplify the computation of error probability over intersymbol interference (ISI) channels, and show numerical results of the methods applied to trellis coded 16-QAM with 2-symbol ISI.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Error Probability Bounds for Trellis Coded Modulation over Sequence Dependent Channels
T2 - IEICE TRANSACTIONS on transactions
SP - 375
EP - 383
AU - Ikuo OKA
AU - Ezio BIGLIERI
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1989
AB - We consider the computation of an upper bound to error probability in Trellis-Coded Modulation (TCM) schemes in sequence dependent channnels. In its most common form, the pairwise-state" technique is applicable to this class of channels. However, it entails a degree of complexity that may not acceptable, because the dimension of the matrices involved in pairwise-state calculations is the square of the number of states, and the number of states, say N, equals the product of the code states and of the channel states. In this paper, we derive an error probability bound based on a computational technique which avoids the consideration of N²N² matrices. It is based on the computaion of the transfer function of a graph with N1 nodes, and whose branch labels are NN matrices rather than scalars. we also describe some looser bounds which simplify the computation of error probability over intersymbol interference (ISI) channels, and show numerical results of the methods applied to trellis coded 16-QAM with 2-symbol ISI.
ER -