By Topic

Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank- (1,L,L) Terms

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)
Lieven De Lathauwer ; Katholieke Univ. Leuven, Leuven ; Alexandre de Baynast

In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an antenna array. The technique is based on a generalization of the canonical or parallel factor decomposition (CANDECOMP/PARAFAC) in multilinear algebra. We present a bound on the number of users under which blind separation and deconvolution is guaranteed. The solution is computed by means of an alternating least squares (ALS) algorithm. The excellent performance is illustrated by means of a number of simulations. We include an explicit expression of the Cramer-Rao bound (CRB) of the transmitted symbols.

Published in:

IEEE Transactions on Signal Processing  (Volume:56 ,  Issue: 4 )