By Topic

Simple polynomial detectors for CDMA downlink transmissions on frequency-selective 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
$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

1 Author(s)
Hachem, W. ; Service Radioelectricite, Ecole Superieure d''Electr., Gif-sur-Yvette, France

In code-division multiple-access (CDMA) transmissions, computing the multiuser minimum mean-squared error (MMSE) detector coefficients requires the inversion of the covariance matrix associated to the received vector signal, an operation usually difficult to implement when the spreading factor and the number of users are large. It is therefore interesting to approximate the inverse by a matrix polynomial. In this correspondence, means for computing the polynomial coefficients are proposed in the context of CDMA downlink transmissions on frequency-selective channels, the users having possibly different powers. Derivations are made in the asymptotic regime where the spreading factor and the number of users grow toward infinity at the same rate. Results pertaining to the mathematics of large random matrices, and in particular to free probability theory, are used. Spreading matrices are modeled as isometric random matrices (spreading vectors orthonormality is a natural assumption in downlink) and also as random matrices with independent and identically distributed (i.i.d.) elements.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 1 )