By Topic

A Systematic Approach to Multistage Detectors in Multipath Fading Channels

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
$33 $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)
L. Cottatellucci ; Forschungszentrum Telekommunikation Wien, Vienna, Austria ; R. R. Muller

We consider linear multistage detectors with universal (large system) weighting for synchronous code-division multiple access (CDMA) in multipath fading channels with many users. A convenient choice of the basis of the projection subspace allows a joint projection of all users. Taking advantage of this property, the complexity per bit of multistage detectors with universal weights scales linearly with the number of users on the uplink CDMA channel, while other known multistage detectors with universal weights and different bases of the projection subspace keep the same quadratic complexity order per bit as the linear minimum mean-square error (LMMSE) detector. We focus on the design of two kinds of detectors with linear complexity. The detector of Type I is obtained as an asymptotic approximation of the polynomial expansion detector proposed by Moshavi The detector of Type II has the same performance as the multistage Wiener filter (MSWF) in large systems. Additionally, general performance expressions for large systems, applicable to any multistage detector with the same basis of the projection subspace (e.g., linear parallel interference canceling detectors), are derived. As a by-product, the performance analysis disproves the widespread belief that the MSWF and the polynomial expansion detector are equivalent. We show that, in general, the MSWF outperforms the latter one and they are equivalent only asymptotically in the case of equal received powers.

Published in:

IEEE Transactions on Information Theory  (Volume:51 ,  Issue: 9 )