A direction set based algorithm for adaptive filtering
A new algorithm is developed for adaptive filtering applications. This algorithm is based on a direction set method and has a computational complexity of O(N) for each update of the system. The method exploits the structure of the objective function and maintains a set of near-conjugate directions w...
Saved in:
| Published in | IEEE transactions on signal processing Vol. 47; no. 2; pp. 535 - 539 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
IEEE
01.02.1999
Institute of Electrical and Electronics Engineers |
| Subjects | |
| Online Access | Get full text |
| ISSN | 1053-587X |
| DOI | 10.1109/78.740139 |
Cover
| Summary: | A new algorithm is developed for adaptive filtering applications. This algorithm is based on a direction set method and has a computational complexity of O(N) for each update of the system. The method exploits the structure of the objective function and maintains a set of near-conjugate directions with respect to the Hessian. This algorithm has a rapid rate of convergence that is comparable with that of the well-known RLS method. The performance of the algorithm is illustrated with adaptive filtering applications. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1053-587X |
| DOI: | 10.1109/78.740139 |