For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Computational Complexity Reduction of Trellis-Coded Co-channel Interference Canceller
Hidekazu MURATA Atsushi FUJIWARA Susumu YOSHIDA
IEICE TRANSACTIONS on Communications
Publication Date: 1996/03/25
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Advanced Adaptive Radio Communication Technologies)
Category: Modulation, Demodulation
digital cellular radio, co-channel interference, interference canceller, trellis coded modulation,
Full Text: PDF>>
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.