Abstract
The problem of blind detection in a synchronous code division multiple access (CDMA) system when there is no knowledge of the users' spreading sequences is considered. An expectation maximization (EM)-based algorithm that exploits the finite alphabet (FA) property of the digital communications source is proposed. Simulations indicate that this approach, which makes use of knowledge of the subspace spanned by the signaling multiplex, achieves the Cramér-Rao lower bound (CRB). The issues of subspace estimation and timing acquisition are also considered.
Original language | English (US) |
---|---|
Pages (from-to) | 1748-1756 |
Number of pages | 9 |
Journal | IEEE Transactions on Signal Processing |
Volume | 49 |
Issue number | 8 |
DOIs | |
State | Published - Aug 2001 |
All Science Journal Classification (ASJC) codes
- Signal Processing
- Electrical and Electronic Engineering
Keywords
- CDMA
- Code-free demodulation
- EM-algorithm