Co-channel interference is a major factor limiting spectral efficiency of a cellular radio system. The trellis-coded co-channel interference canceller (TCC) leading to the significant increase of traffic capacity of a cellular system has been proposed. In this scheme, a maximum-likelihood sequence estimation implemented with the Viterbi algorithm is extended to estimate both desired signal and co-channel interference, and combined with trellis-coded modulation to enhance the co-channel interference cancelling capability. The complexity of TCC grows exponentially with the channel memory and the constraint length of the trellis encoder. In this paper, two reduced-state sequence estimation algorithms, namely, the delayed decision feedback sequence estimation and the M-algorithm, are applied to TCC and their performance is compared. In addition, effective trellis coded modulation schemes to reduce the computational complexity are proposed. The performance of these schemes is examined through simulations, and compared to that of a conventional interference canceller.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Hidekazu MURATA, Atsushi FUJIWARA, Susumu YOSHIDA, "Computational Complexity Reduction of Trellis-Coded Co-channel Interference Canceller" in IEICE TRANSACTIONS on Communications,
vol. E79-B, no. 3, pp. 342-352, March 1996, doi: .
Abstract: Co-channel interference is a major factor limiting spectral efficiency of a cellular radio system. The trellis-coded co-channel interference canceller (TCC) leading to the significant increase of traffic capacity of a cellular system has been proposed. In this scheme, a maximum-likelihood sequence estimation implemented with the Viterbi algorithm is extended to estimate both desired signal and co-channel interference, and combined with trellis-coded modulation to enhance the co-channel interference cancelling capability. The complexity of TCC grows exponentially with the channel memory and the constraint length of the trellis encoder. In this paper, two reduced-state sequence estimation algorithms, namely, the delayed decision feedback sequence estimation and the M-algorithm, are applied to TCC and their performance is compared. In addition, effective trellis coded modulation schemes to reduce the computational complexity are proposed. The performance of these schemes is examined through simulations, and compared to that of a conventional interference canceller.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e79-b_3_342/_p
Copy
@ARTICLE{e79-b_3_342,
author={Hidekazu MURATA, Atsushi FUJIWARA, Susumu YOSHIDA, },
journal={IEICE TRANSACTIONS on Communications},
title={Computational Complexity Reduction of Trellis-Coded Co-channel Interference Canceller},
year={1996},
volume={E79-B},
number={3},
pages={342-352},
abstract={Co-channel interference is a major factor limiting spectral efficiency of a cellular radio system. The trellis-coded co-channel interference canceller (TCC) leading to the significant increase of traffic capacity of a cellular system has been proposed. In this scheme, a maximum-likelihood sequence estimation implemented with the Viterbi algorithm is extended to estimate both desired signal and co-channel interference, and combined with trellis-coded modulation to enhance the co-channel interference cancelling capability. The complexity of TCC grows exponentially with the channel memory and the constraint length of the trellis encoder. In this paper, two reduced-state sequence estimation algorithms, namely, the delayed decision feedback sequence estimation and the M-algorithm, are applied to TCC and their performance is compared. In addition, effective trellis coded modulation schemes to reduce the computational complexity are proposed. The performance of these schemes is examined through simulations, and compared to that of a conventional interference canceller.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Computational Complexity Reduction of Trellis-Coded Co-channel Interference Canceller
T2 - IEICE TRANSACTIONS on Communications
SP - 342
EP - 352
AU - Hidekazu MURATA
AU - Atsushi FUJIWARA
AU - Susumu YOSHIDA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E79-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 1996
AB - Co-channel interference is a major factor limiting spectral efficiency of a cellular radio system. The trellis-coded co-channel interference canceller (TCC) leading to the significant increase of traffic capacity of a cellular system has been proposed. In this scheme, a maximum-likelihood sequence estimation implemented with the Viterbi algorithm is extended to estimate both desired signal and co-channel interference, and combined with trellis-coded modulation to enhance the co-channel interference cancelling capability. The complexity of TCC grows exponentially with the channel memory and the constraint length of the trellis encoder. In this paper, two reduced-state sequence estimation algorithms, namely, the delayed decision feedback sequence estimation and the M-algorithm, are applied to TCC and their performance is compared. In addition, effective trellis coded modulation schemes to reduce the computational complexity are proposed. The performance of these schemes is examined through simulations, and compared to that of a conventional interference canceller.
ER -