The Euclidean Direction Search Algorithm in Adaptive Filtering(<特集>Special Section on the Trend of Digital Signal Processing and Its Future Direction)
スポンサーリンク
概要
- 論文の詳細を見る
A new class of least-squares algorithms is presented for adaptive filtering. The idea is to use a fixed set of directions and perform line search with one direction at a time in a cyclic fashion. These algorithms are called Euclidean Direction Search (EDS) algorithms. The fast version of this class is called the Fast-EDS or FEDS algorithm. It is shown to have O(N) computational complexity and a convergence rate comparable to that of the RLS algorithm. Computer simulations are presented to illustrate the performance of the new algorithm.
- 社団法人電子情報通信学会の論文
- 2002-03-01
著者
-
Xu Guo-fang
Dataplay
-
BOSE Tamal
Electrical and Computer Engineering, Utah State University
-
Bose Tamal
Electrical And Computer Engineering Utah State University