Skip to Main Content
Multiuser detection algorithms usually have very high computational complexity, which greatly limits their usage. Polynomial expansion (PE) multiuser detector can be viewed as an iterative approach to approximate the linear multiuser detectors with low complexity (O(N2)). In this paper, we propose a new PE detector, which exhibits both faster convergence (fewer iterations) and higher performance (comparable to the MMSE multiuser detector). Analysis and simulation results for the third generation mobile communication system TD-SCDMA have shown the viability of this new detector. Even under high mobility circumstance, the proposed PE detector can still sustain its good performance.