Implementation aspects of linear multiuser detectors in asynchronous CDMA systems

Author

Juntti, Markku J. ; Lilleberg, Jorma O.

Author_Institution

Telecommun. Lab., Oulu Univ., Finland

Volume

2

fYear

1996

fDate

22-25 Sep 1996

Firstpage

842

Abstract

Several linear multiuser detectors for code-division multiple-access (CDMA) systems can be characterized as an inverse of some form of correlation matrices. If the correlations change, the detectors must be updated. Efficient algorithms for updating multiuser detectors in asynchronous CDMA systems are considered. Computation algorithms of the decorrelating, the LMMSE, and the noise-whitening detectors based on an order-recursive Cholesky factorization are presented and their computational complexity is analyzed. The algorithmic complexity is studied in a mobile communication example

Keywords

code division multiple access; computational complexity; correlation methods; land mobile radio; matrix inversion; signal detection; LMMSE detector; algorithmic complexity; asynchronous CDMA systems; code division multiple access; computation algorithms; computational complexity; decorrelating detector; inverse correlation matrices; linear multiuser detectors; mobile communication; noise whitening detectors; order recursive Cholesky factorization; Algorithm design and analysis; Change detection algorithms; Code division multiplexing; Computational complexity; Decorrelation; Detectors; Mobile handsets; Multiaccess communication; Niobium; Telecommunications;

fLanguage

English

Publisher

ieee

Conference_Titel

Spread Spectrum Techniques and Applications Proceedings, 1996., IEEE 4th International Symposium on

Conference_Location

Mainz

Print_ISBN

0-7803-3567-8

Type

conf

DOI

10.1109/ISSSTA.1996.563242

Filename

563242