Abstract
We present a class of constraint LMS like adaptive linear detection schemes that constitutes a generalization to the popular blind adaptive detector. We show that, contrary to the general belief, the conventional LMS and its constraint version, when in training mode, do not necessarily outperform the blind LMS of [1]. Trained algorithms uniformly outperform their blind counterparts only if they incorporate knowledge of the amplitude of the user of interest. Decision directed versions of such algorithms are shown to be equally efficient as their trained prototypes and significantly better than the blind versions.
Original language | English (US) |
---|---|
Pages (from-to) | 8 |
Number of pages | 1 |
Journal | IEEE International Symposium on Information Theory - Proceedings |
State | Published - 2001 |
Externally published | Yes |
Event | 2001 IEEE International Symposium on Information Theory (ISIT 2001) - Washington, DC, United States Duration: Jun 24 2001 → Jun 29 2001 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics