NDLI: On stochastic approximation and the hierarchy of adaptive array algorithms

Content Provider	IEEE Xplore Digital Library
Author	Scharf, L.L.
Copyright Year	1972
Description	Author affiliation: Colorado State University, Fort Collins, Colorado (Scharf, L.L.)
Abstract	Stochastic approximation is used to illustrate the connection between several recently proposed recursive algorithms for adaptation of array processing structures. The development illustrates the manner in which incorporation of a priori statistical information leads from one algorithm to another. This link establishes a hierarchy among the algorithms. Sufficient conditions are established to ensure convergence of the algorithms and the conditions are shown to be universal in the sense that they are independent of the particular algorithm implemented. The signal processing problem considered throughout the paper is one of estimating (in real time) the time history of a stochastic, propagating signal that is immersed in additive, propagating and nonpropagating noise. The propagating noise is sometimes called interference.
Starting Page	258
Ending Page	261
File Size	296640
Page Count	4
File Format	PDF
DOI	10.1109/CDC.1972.268997
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1972-12-13
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Stochastic processes Adaptive arrays Approximation algorithms Signal processing algorithms Additive noise Array signal processing Sufficient conditions Convergence History Stochastic resonance
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Convergence of stochastic approximation under general noise and stability conditions

On equivalence of some noise conditions for stochastic approximation algorithms

Necessary and sufficient conditions for convergence of stochastic approximation algorithms under arbitrary disturbances

On conditions for convergence rates of stochastic approximation algorithms

Convergence of the Robbins-Monro algorithm under arbitrary disturbances

Constrained adaptive LMS L-filters

Almost sure convergence of two time-scale stochastic approximation algorithms

Performance of RLMS algorithm in adaptive array beam forming

Necessary and sufficient conditions and robustness for convergence of adaptive filtering algorithms

On stochastic approximation and the hierarchy of adaptive array algorithms

Similar Documents

Convergence of stochastic approximation under general noise and stability conditions

On equivalence of some noise conditions for stochastic approximation algorithms

Necessary and sufficient conditions for convergence of stochastic approximation algorithms under arbitrary disturbances

On conditions for convergence rates of stochastic approximation algorithms

Convergence of the Robbins-Monro algorithm under arbitrary disturbances

Constrained adaptive LMS L-filters

Almost sure convergence of two time-scale stochastic approximation algorithms

Performance of RLMS algorithm in adaptive array beam forming

Necessary and sufficient conditions and robustness for convergence of adaptive filtering algorithms

On stochastic approximation and the hierarchy of adaptive array algorithms