A multiuser detector based on schur algorithm

Authors:
Yanjun Hu;Fang Hu
Affiliations:
Key Laboratory of Intelligent Computing and Signal Processing, Ministry of Education, Anhui University, Hefei, Anhui, P. R. China;Key Laboratory of Intelligent Computing and Signal Processing, Ministry of Education, Anhui University, Hefei, Anhui, P. R. China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 2
Cited 0

Minimum probability of error for asynchronous Gaussian multiple-access channels

IEEE Transactions on Information Theory
Multiuser Detection

Multiuser Detection

Quantified Score

Hi-index	0.00

Visualization

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.