DocumentCode :
302666
Title :
A fast adaptive algorithm based on the gradient method for the reduction of the computational requirements
Author :
Yoshimoto, Sadanobu ; Kitano, Yuko ; Furukawa, Toshihiro ; Urahama, Kiichi
Author_Institution :
Graduate Sch. of Kyushu Inst. of Design, Fukuoka, Japan
Volume :
2
fYear :
1996
fDate :
12-15 May 1996
Firstpage :
718
Abstract :
The performance of the adaptive algorithm is mainly evaluated by the following: 1) the characteristics for the convergence and 2) the reduction of the computational requirements per sample time. The algorithm is composed by the block signal processing and the orthogonal projection which satisfy these requirements. Furthermore, a method to improve convergence speed of the algorithm is given; the “shifting” technique. And, we can consider the adaptive algorithm which can be derived by introducing the “shifting” technique. This algorithm has faster convergence speed. The purpose of this paper is to present a new adaptive algorithm whose computational requirements are less than that of the original algorithm
Keywords :
adaptive signal processing; convergence of numerical methods; filtering theory; adaptive algorithm; block signal processing; computational requirements; convergence speed; gradient method; orthogonal projection; shifting technique; Adaptive algorithm; Adaptive filters; Algorithm design and analysis; Convergence; Design engineering; Educational institutions; Gradient methods; Least squares approximation; Noise cancellation; Signal processing algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7803-3073-0
Type :
conf
DOI :
10.1109/ISCAS.1996.541826
Filename :
541826
Link To Document :
بازگشت