Improvements of the Information-Bit Error Rate of Trellis Code Modulation Systems

Jun DU; Masao KASAHARA

Improvements of the Information-Bit Error Rate of Trellis Code Modulation Systems

Jun DU, Masao KASAHARA

Full Text Views

0

Cite this

Summary :

Trellis coded modulation (TCM) is a new and attractive communication technique which yields significant coding gain with no degradation of the bandwidth efficiency. So far, researches concerning the TCM have concentrated upon minimizing the error-event probability (EEP). However, for the various bitwise data transmission systems, decreasing the post-decoding information-bit error rate (IBER) is more important than only minimizing the EEP. This paper is concerned with a simple but important problem that how to improve the IBER in TCM systems. The IBER of a TCM system depends not only on the EEP but also on the mapping of a binary m-tuple to a 2^m-ary channel signal. A signal mapping called Set Partitioning mapping has been well adopted in the previously known TCM systems. In this paper, another well known signal mapping, the Gray-code mapping, is investigated as a promising signal mapping in TCM, and compared with the Set Partitioning mapping. Through a computer search, a number of optimun trellis codes with Gray-code mapping are found. It is shown that these codes have the minimum Euclidean distances as large as those of the Ungerboeck codes and yet yield smaller EEP and IBER.

Publication: IEICE TRANSACTIONS on transactions Vol.E72-E No.5 pp.609-614

Publication Date: 1989/05/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Foundations of Signal Theory and Communication Theory

Authors

Jun DU
Masao KASAHARA

Keyword

Cite this

Copy

Jun DU, Masao KASAHARA, "Improvements of the Information-Bit Error Rate of Trellis Code Modulation Systems" in IEICE TRANSACTIONS on transactions, vol. E72-E, no. 5, pp. 609-614, May 1989, doi: .
Abstract: Trellis coded modulation (TCM) is a new and attractive communication technique which yields significant coding gain with no degradation of the bandwidth efficiency. So far, researches concerning the TCM have concentrated upon minimizing the error-event probability (EEP). However, for the various bitwise data transmission systems, decreasing the post-decoding information-bit error rate (IBER) is more important than only minimizing the EEP. This paper is concerned with a simple but important problem that how to improve the IBER in TCM systems. The IBER of a TCM system depends not only on the EEP but also on the mapping of a binary m-tuple to a 2^m-ary channel signal. A signal mapping called Set Partitioning mapping has been well adopted in the previously known TCM systems. In this paper, another well known signal mapping, the Gray-code mapping, is investigated as a promising signal mapping in TCM, and compared with the Set Partitioning mapping. Through a computer search, a number of optimun trellis codes with Gray-code mapping are found. It is shown that these codes have the minimum Euclidean distances as large as those of the Ungerboeck codes and yet yield smaller EEP and IBER.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e72-e_5_609/_p

Copy

@ARTICLE{e72-e_5_609,
author={Jun DU, Masao KASAHARA, },
journal={IEICE TRANSACTIONS on transactions},
title={Improvements of the Information-Bit Error Rate of Trellis Code Modulation Systems},
year={1989},
volume={E72-E},
number={5},
pages={609-614},
abstract={Trellis coded modulation (TCM) is a new and attractive communication technique which yields significant coding gain with no degradation of the bandwidth efficiency. So far, researches concerning the TCM have concentrated upon minimizing the error-event probability (EEP). However, for the various bitwise data transmission systems, decreasing the post-decoding information-bit error rate (IBER) is more important than only minimizing the EEP. This paper is concerned with a simple but important problem that how to improve the IBER in TCM systems. The IBER of a TCM system depends not only on the EEP but also on the mapping of a binary m-tuple to a 2^m-ary channel signal. A signal mapping called Set Partitioning mapping has been well adopted in the previously known TCM systems. In this paper, another well known signal mapping, the Gray-code mapping, is investigated as a promising signal mapping in TCM, and compared with the Set Partitioning mapping. Through a computer search, a number of optimun trellis codes with Gray-code mapping are found. It is shown that these codes have the minimum Euclidean distances as large as those of the Ungerboeck codes and yet yield smaller EEP and IBER.},
keywords={},
doi={},
ISSN={},
month={May},}

Copy

TY - JOUR
TI - Improvements of the Information-Bit Error Rate of Trellis Code Modulation Systems
T2 - IEICE TRANSACTIONS on transactions
SP - 609
EP - 614
AU - Jun DU
AU - Masao KASAHARA
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 5
JA - IEICE TRANSACTIONS on transactions
Y1 - May 1989
AB - Trellis coded modulation (TCM) is a new and attractive communication technique which yields significant coding gain with no degradation of the bandwidth efficiency. So far, researches concerning the TCM have concentrated upon minimizing the error-event probability (EEP). However, for the various bitwise data transmission systems, decreasing the post-decoding information-bit error rate (IBER) is more important than only minimizing the EEP. This paper is concerned with a simple but important problem that how to improve the IBER in TCM systems. The IBER of a TCM system depends not only on the EEP but also on the mapping of a binary m-tuple to a 2^m-ary channel signal. A signal mapping called Set Partitioning mapping has been well adopted in the previously known TCM systems. In this paper, another well known signal mapping, the Gray-code mapping, is investigated as a promising signal mapping in TCM, and compared with the Set Partitioning mapping. Through a computer search, a number of optimun trellis codes with Gray-code mapping are found. It is shown that these codes have the minimum Euclidean distances as large as those of the Ungerboeck codes and yet yield smaller EEP and IBER.
ER -