The Sign-Sign Algorithm: Checking Persistent Excitation for Periodic Inputs

S Dasgupta; C.R Johnson; A.M Baksho

doi:10.1016/S1474-6670(17)48271-1

Back

The Sign-Sign Algorithm: Checking Persistent Excitation for Periodic Inputs

Journal article

Open access

Peer reviewed

The Sign-Sign Algorithm: Checking Persistent Excitation for Periodic Inputs

S Dasgupta, C.R Johnson and A.M Baksho

IFAC Proceedings Volumes, Vol.26(2), pp.287-290

07/1993

DOI: 10.1016/S1474-6670(17)48271-1

Files and links (1)

url

https://doi.org/10.1016/S1474-6670(17)48271-1View

Published (Version of record) Open Access

Abstract

The Sign-Sign (SS) algorithm is a computationally efficient adaptive identifier, often used in signal processing tasks. It is obtained by introducing signum functions on both the regressor and the prediction error multiplicands in the update kernel of the well known LMS algorithm. This paper discusses how a persistent excitation condition related to this algorithm can be checked for periodic regressors through a finite amount of computations.

Adaptive

Identification

Nonlinear

Optimization

Persistent Excitation

Details

Title: Subtitle: The Sign-Sign Algorithm: Checking Persistent Excitation for Periodic Inputs
Creators: S Dasgupta - University of Iowa
C.R Johnson - Cornell University
A.M Baksho - University of Iowa
Resource Type: Journal article
Publication Details: IFAC Proceedings Volumes, Vol.26(2), pp.287-290
DOI: 10.1016/S1474-6670(17)48271-1
ISSN: 1474-6670
Language: English
Date published: 07/1993
Academic Unit: Electrical and Computer Engineering
Record Identifier: 9984198015202771

Metrics

11 Record Views