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 article

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

Fingerprint

Gradient methods
Adaptive algorithms
Signal processing
signal processing
method
speed

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Fast adaptive algorithm based on the gradient method for the reduction of the computational requirements. / Yoshimoto, Sadanobu; Kitano, Yuko; Furukawa, Toshihiro; Urahama, Kiichi.

In: Proceedings - IEEE International Symposium on Circuits and Systems, Vol. 2, 01.01.1996, p. 718-721.

Research output: Contribution to journalConference article

@article{cbcbed57a3124a49a173995bc820a9d2,
title = "Fast adaptive algorithm based on the gradient method for the reduction of the computational requirements",
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, (**).",
author = "Sadanobu Yoshimoto and Yuko Kitano and Toshihiro Furukawa and Kiichi Urahama",
year = "1996",
month = "1",
day = "1",
language = "English",
volume = "2",
pages = "718--721",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

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

AU - Yoshimoto, Sadanobu

AU - Kitano, Yuko

AU - Furukawa, Toshihiro

AU - Urahama, Kiichi

PY - 1996/1/1

Y1 - 1996/1/1

N2 - 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, (**).

AB - 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, (**).

UR - http://www.scopus.com/inward/record.url?scp=0029722543&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029722543&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0029722543

VL - 2

SP - 718

EP - 721

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -