Per-survivor interference cancellation structures for low-complexity ML detection of DS/CDMA signals

Author

Esteves, Eduardo

Author_Institution

Qualcomm Inc., USA

fYear

1999

fDate

1999

Firstpage

482

Abstract

In this paper we investigate reduced-complexity approximations of ML multiuser sequence detection of DS/CDMA signals where the likelihood computations are based on reduced-state trellises. The proposed structures rely on survivor information to cancel interference terms in the branch metric equations. The implementation complexity of this family of detectors can be easily traded for performance, with structures ranging from the optimum ML detector to a successive, symbol-by-symbol interference cancellation scheme. Simulation results show a significant complexity reduction with marginal performance degradation

Keywords

code division multiple access; computational complexity; error statistics; interference suppression; iterative decoding; maximum likelihood detection; multiuser channels; radiofrequency interference; spread spectrum communication; BER performance; DS/CDMA signals; ML multiuser sequence detection; branch metric equations; error propagation; implementation complexity; iterative decoding; likelihood computations; low-complexity ML detection; optimum ML detector; per-survivor interference cancellation; performance; reduced-complexity approximations; reduced-state trellises; simulation results; successive interference cancellation; survivor information; symbol-by-symbol interference cancellation; Degradation; Detectors; Equations; Fading; Interference cancellation; Maximum likelihood detection; Multiaccess communication; Research and development; Silicon carbide; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1999. GLOBECOM '99

Conference_Location

Rio de Janeireo

Print_ISBN

0-7803-5796-5

Type

conf

DOI

10.1109/GLOCOM.1999.831686

Filename

831686