Blind PARAFAC receivers for DS-CDMA systems (2000)
Cached
Download Links
| Venue: | IEEE TRANS. SIGNAL PROCESSING |
| Citations: | 35 - 12 self |
BibTeX
@ARTICLE{Sidiropoulos00blindparafac,
author = {Nicholas D. Sidiropoulos and Georgios B. Giannakis and Rasmus Bro},
title = {Blind PARAFAC receivers for DS-CDMA systems},
journal = {IEEE TRANS. SIGNAL PROCESSING},
year = {2000},
volume = {48},
number = {3},
pages = {810--823}
}
Years of Citing Articles
OpenURL
Abstract
This paper links the direct-sequence code-division multiple access (DS-CDMA) multiuser separation-equalization-detection problem to the parallel factor (PARAFAC) model, which is an analysis tool rooted in psychometrics and chemometrics. Exploiting this link, it derives a deterministic blind PARAFAC DS-CDMA receiver with performance close to nonblind minimum mean-squared error (MMSE). The proposed PARAFAC receiver capitalizes on code, spatial, and temporal diversity-combining, thereby supporting small sample sizes, more users than sensors, and/or less spreading than users. Interestingly, PARAFAC does not require knowledge of spreading codes, the specifics of multipath (interchip interference), DOA-calibration information, finite alphabet/constant modulus, or statistical independence/whiteness to recover the information-bearing signals. Instead, PARAFAC relies on a fundamental result regarding the uniqueness of low-rank three-way array decomposition due to Kruskal (and generalized herein to the complex-valued case) that guarantees identifiability of all relevant signals and propagation parameters. These and other issues are also demonstrated in pertinent simulation experiments.







