Local stable minima of the Sato recursive identification scheme

Rodney A. Kennedy; Brian D.O. Anderson; Zhi Ding; C. Richard Johnson

Local stable minima of the Sato recursive identification scheme

Rodney A. Kennedy^*, Brian D.O. Anderson, Zhi Ding, C. Richard Johnson

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

7 Citations (Scopus)

Abstract

A common recursive identification scheme used in a class of adaptive systems problems involving blind channel equalization (but potentially usable elsewhere) is an algorithm due to Sato. The authors study the convergence properties of the Sato blind algorithm by characterizing the mean cost surface. The results show the important feature that the equalizer parameters may converge to parameter settings which fail to achieve the ideal objective which is to approximate the inverse with sufficient accuracy. A proof that a well-posed Sato algorithm can misbehave is presented. Examples are used to illustrate the results.

Original language	English
Pages (from-to)	3194-3199
Number of pages	6
Journal	Proceedings of the IEEE Conference on Decision and Control
Volume	6
Publication status	Published - 1990
Externally published	Yes
Event	Proceedings of the 29th IEEE Conference on Decision and Control Part 6 (of 6) - Honolulu, HI, USA Duration: 5 Dec 1990 → 7 Dec 1990

Cite this

@article{6fcbe373cd4c4efc8d6a7a9521a5272d,

title = "Local stable minima of the Sato recursive identification scheme",

abstract = "A common recursive identification scheme used in a class of adaptive systems problems involving blind channel equalization (but potentially usable elsewhere) is an algorithm due to Sato. The authors study the convergence properties of the Sato blind algorithm by characterizing the mean cost surface. The results show the important feature that the equalizer parameters may converge to parameter settings which fail to achieve the ideal objective which is to approximate the inverse with sufficient accuracy. A proof that a well-posed Sato algorithm can misbehave is presented. Examples are used to illustrate the results.",

author = "Kennedy, {Rodney A.} and Anderson, {Brian D.O.} and Zhi Ding and Johnson, {C. Richard}",

year = "1990",

language = "English",

volume = "6",

pages = "3194--3199",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 29th IEEE Conference on Decision and Control Part 6 (of 6) ; Conference date: 05-12-1990 Through 07-12-1990",

}

TY - JOUR

T1 - Local stable minima of the Sato recursive identification scheme

AU - Kennedy, Rodney A.

AU - Anderson, Brian D.O.

AU - Ding, Zhi

AU - Johnson, C. Richard

PY - 1990

Y1 - 1990

N2 - A common recursive identification scheme used in a class of adaptive systems problems involving blind channel equalization (but potentially usable elsewhere) is an algorithm due to Sato. The authors study the convergence properties of the Sato blind algorithm by characterizing the mean cost surface. The results show the important feature that the equalizer parameters may converge to parameter settings which fail to achieve the ideal objective which is to approximate the inverse with sufficient accuracy. A proof that a well-posed Sato algorithm can misbehave is presented. Examples are used to illustrate the results.

AB - A common recursive identification scheme used in a class of adaptive systems problems involving blind channel equalization (but potentially usable elsewhere) is an algorithm due to Sato. The authors study the convergence properties of the Sato blind algorithm by characterizing the mean cost surface. The results show the important feature that the equalizer parameters may converge to parameter settings which fail to achieve the ideal objective which is to approximate the inverse with sufficient accuracy. A proof that a well-posed Sato algorithm can misbehave is presented. Examples are used to illustrate the results.

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

M3 - Conference article

AN - SCOPUS:0025565587

SN - 0191-2216

VL - 6

SP - 3194

EP - 3199

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

T2 - Proceedings of the 29th IEEE Conference on Decision and Control Part 6 (of 6)

Y2 - 5 December 1990 through 7 December 1990

ER -

Local stable minima of the Sato recursive identification scheme

Abstract

Other files and links

Fingerprint

Cite this