Abstract
An adaptive filtering algorithm based on the Euclidean Direction Search (EDS) method is presented for channel equalization. It is shown that this algorithm has a computational complexity of O(N), where N is the number of adaptable filter coefficients. It is also proven that the algorithm converges to the true solution and that the convergence rate of the EDS method is superior to that of the well known LMS algorithm. Computer simulations of channel equalization using the EDS method exhibit a fast rate of convergence and low sensitivity to the eigenvalue spread of the correlation matrix.
| Original language | English (US) |
|---|---|
| Pages | 3479-3484 |
| Number of pages | 6 |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration - Sydney, NSW, Aust Duration: Nov 8 1998 → Nov 12 1998 |
Other
| Other | Proceedings of the IEEE GLOBECOM 1998 - The Bridge to the Global Integration |
|---|---|
| City | Sydney, NSW, Aust |
| Period | 11/8/98 → 11/12/98 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Global and Planetary Change