Abstract
The problem of blind detection in a synchronous CDMA system when there is no knowledge of the users' spreading sequences is considered. An EM-based algorithm which exploits the finite alphabet property of the digital communications source is proposed. Simulations show that this approach, which makes use of knowledge of the subspace spanned by the signaling multiplex, achieves the Cramer-Rao lower bound. The issues of subspace estimation and timing acquisition are also considered.
| Original language | English (US) |
|---|---|
| Pages | 738-742 |
| Number of pages | 5 |
| State | Published - 2000 |
| Event | 2000 IEEE 6th International Symposium on Spread Spectrum Techniques and Applications (ISSSTA 2000) - Parsippany, NJ, USA Duration: Sep 6 2000 → Sep 8 2000 |
Other
| Other | 2000 IEEE 6th International Symposium on Spread Spectrum Techniques and Applications (ISSSTA 2000) |
|---|---|
| City | Parsippany, NJ, USA |
| Period | 9/6/00 → 9/8/00 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
- Control and Systems Engineering