Blind channel estimation for space-time coded WCDMA
EURASIP Journal on Wireless Communications and Networking - Special issue on multiuser MIMO networks
EURASIP Journal on Wireless Communications and Networking - Special issue on innovative signal transmission and detection techniques for next generation cellular CDMA systems
A low-complexity blind multiuser receiver for long-code CDMA
EURASIP Journal on Wireless Communications and Networking - Special issue on innovative signal transmission and detection techniques for next generation cellular CDMA systems
Blind multiuser detection for long-code CDMA systems with transmission-induced cyclostationarity
EURASIP Journal on Wireless Communications and Networking - Special issue on advanced signal processing algorithms for wireless communications
Blind channel estimation for MC-CDMA systems with long spreading codes
Signal Processing
Signal processing advances for 3G WCDMA: from rake receivers to blind techniques
IEEE Communications Magazine
Sparsity-aware estimation of CDMA system parameters
EURASIP Journal on Advances in Signal Processing - Special issue on advanced equalization techniques for wireless communications
| Hi-index | 35.68 |
The problem of blind and semiblind channel estimation and symbol detection is considered for long-code wideband code division multiple access (CDMA) systems, including systems with multirate and multicode transmissions. A decorrelating matched filter, implemented efficiently in state-space, eliminates multiaccess interference and produces a bank of vector processes. Each vector process spans a one-dimensional (1-D) subspace from which channel parameters and data symbols of one user are estimated jointly by least squares. A new identifiability condition is established, which suggests that channels unidentifiable, in short-code CDMA systems are almost surely identifiable when aperiodic spreading codes are used. The decorrelating matched filter is implemented efficiently based on time-varying state-space realizations that exploit the structure of sparsity of the code matrix. The mean square error of the estimated channel is compared to the Cramer-Rao bound, and a bit error rate (BER) expression for the proposed algorithm is presented.