A Multiuser Detector Based on Schur Algorithm

Author

Hu, Yanjun ; Hu, Fang

Author_Institution

Key Lab. of Intell. Comput. & Signal Process., Anhui Univ., Hefei, China

fYear

2009

fDate

24-26 Sept. 2009

Firstpage

1

Lastpage

4

Abstract

A multiuser detector based on Schur algorithm is studied in this paper. Because the computational complexity of the conventional decorrelating detector is high while computing the inverse of system matrices, especially when the system is asynchronous and the number of users is huge. The simulation results show that the performance of the multiuser detector based on Schur algorithm is similar to that of decorrelating detector, but it´s computational complexity is much lower than decorrelating detector´s.

Keywords

code division multiple access; computational complexity; matrix algebra; multiuser detection; spread spectrum communication; DS-CDMA; Schur algorithm; computational complexity; conventional decorrelating detector; multiuser detector; system matrices; Computational complexity; Computational modeling; Decorrelation; Detectors; Equations; Iterative algorithms; Matrix decomposition; Multiaccess communication; Propagation delay; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-3692-7

Electronic_ISBN

978-1-4244-3693-4

Type

conf

DOI

10.1109/WICOM.2009.5304109

Filename

5304109