By Topic

A fast converging PE detector using Lanczos method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Detert, T. ; Inst. fur Phys. und Theor. Chem., Technische Univ. Darmstadt, Germany ; Sessler, G.M.A.

The polynomial expansion (PE) multiuser detector (MUD) is a well known iterative approach to approximate the decorrelating or the minimum mean-squared error (MMSE) detectors. The computational complexity for the direct matrix inversion involved with the decorrelating and the MMSE detector is O(K3), where K is the number of users. Due to the iterative approximation, the computational complexity of the PE detector can be O(K2) instead. The text at hand presents a new method for a PE detector based on the estimation of the eigenvalues of the channel correlation matrix by the implicitly restarted Lanczos method (IRLM). The tight estimate of the eigenvalues results in faster convergence compared to the MMSE detector. Also, a better near-far resistance is achieved. As an application, the PE detectors presented here are tested in a UMTS terrestrial radio access (UTRA) frequency division duplex (FDD) uplink multiuser environment, where the multiple users are assumed to be asynchronous.

Published in:

Signal Processing Advances in Wireless Communications, 2004 IEEE 5th Workshop on

Date of Conference:

11-14 July 2004