2005Unpublished venueRequires access

Polynomial Expansion Based Fast Iterative Multiuser Detection Algorithm For Synchronous DS-CDMA Systems

Jinfan Zhang, Yongle Wu, Jing Gu, Shidong Zhou, Jing Wang

Open publisher page 2 citations

Abstract

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(N/sup 2/)). 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.

About this research paper

What this paper is about

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(N/sup 2/)). 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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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(N/sup 2/)). 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.

Key concepts: Multiuser detection, Detector, Code division multiple access, Synchronous CDMA, Convergence (economics), Algorithm, Computer science, Computational complexity theory

Related papers

Back to paper searchBrowse research topicsOriginal source
Polynomial Expansion Based Fast Iterative Multiuser Detection Algorithm For Synchronous DS-CDMA Systems — Research Paper | ScholarLens