Fast adaptive algorithm based on the gradient method for the reduction of the computational requirements

Sadanobu Yoshimoto, Yuko Kitano, Toshihiro Furukawa, Kiichi Urahama

Research output: Contribution to journalConference articlepeer-review

Abstract

The performance of the adaptive algorithm is mainly evaluated by the following two : 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 as that is relatively satisfied with these requirements. Furthermore, method which convergence speed of the (*) speed up is 'shifting' technique. And, we can consider the adaptive algorithm (**) which can be derived by introducing the 'shifting' technique to the (*). The algorithm (**) has faster convergence speed than that of (*). From the point of view of computational requirements, however, the (**) is inferior to the (*). The purpose of this paper is to present a new adaptive algorithm whose computational requirements are less than that of the algorithm, (**).

Original languageEnglish
Pages (from-to)718-721
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume2
Publication statusPublished - Jan 1 1996
EventProceedings of the 1996 IEEE International Symposium on Circuits and Systems, ISCAS. Part 1 (of 4) - Atlanta, GA, USA
Duration: May 12 1996May 15 1996

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Fast adaptive algorithm based on the gradient method for the reduction of the computational requirements'. Together they form a unique fingerprint.

Cite this