Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank- Terms

Authors:
L. De Lathauwer;A. de Baynast
Affiliations:
Katholieke Univ. Leuven, Leuven;-
Venue:
IEEE Transactions on Signal Processing
Year:
2008

Citing 0
Cited 5

Letters: Binaural semi-blind dereverberation of noisy convoluted speech signals

Neurocomputing
Uniqueness Conditions for Constrained Three-Way Factor Decompositions with Linearly Dependent Loadings

SIAM Journal on Matrix Analysis and Applications
Tensor space-time (TST) coding for MIMO wireless communication systems

Signal Processing
Block component analysis, a new concept for blind source separation

LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
A combination of parallel factor and independent component analysis

Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

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.