Abstract
A blind adaptive interference suppression algorithm for Direct-Sequence Code-Division Multiple-Access using the orthogonal Sato cost criterion is presented. The algorithm is blind in the sense that it does not require a training sequence, although it does require (approximate knowledge of the user spreading waveform and associated timing. This orthogonally anchored Sato cost function leads to a stochastic gradient algorithm that has the advantage relative to the minimum variance algorithms.
Original language | English (US) |
---|---|
Pages | 314 |
Number of pages | 1 |
State | Published - 1995 |
Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: Sep 17 1995 → Sep 22 1995 |
Other
Other | Proceedings of the 1995 IEEE International Symposium on Information Theory |
---|---|
City | Whistler, BC, Can |
Period | 9/17/95 → 9/22/95 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics