Iterative list-sequential (LISS) detector for fading multiple-access channels

Author

Kuhn, Christian ; Hagenauer, Joachim

Author_Institution

Inst. for Commun. Eng., Munich Univ. of Technol., Munchen, Germany

Volume

1

fYear

2004

fDate

29 Nov.-3 Dec. 2004

Firstpage

330

Abstract

We study a list-sequential (LISS) multiuser detector for coded applications in a turbo scheme. Optimal with respect to the bit error rate within that iterative scheme would be an APP detector that calculates the a posteriori probabilities. Unfortunately, this detector suffers from a prohibitively high computational complexity for a large number of users. Therefore, we apply a sequential algorithm operating on a tree that approximates the a posteriori probabilities with reduced complexity. The tradeoff between performance and computational burden can be controlled by the size of the available memory.

Keywords

code division multiple access; error statistics; fading channels; iterative methods; multiuser detection; sequential estimation; trees (mathematics); turbo codes; APP detector; LISS detector; a posteriori probabilities; bit error rate; coded CDMA systems; fading multiple-access channels; iterative list-sequential detector; multiuser detection; probability approximation tree; sequential algorithm; spreading codes; turbo codes; Computational complexity; Detectors; Fading; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Multiaccess communication; Multiuser detection; Probability; Size control;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE

Print_ISBN

0-7803-8794-5

Type

conf

DOI

10.1109/GLOCOM.2004.1377964

Filename

1377964