Referenced Items are not available for this document.
It is shown that the weak convergence results of A. Benveniste et al. (IEEE Trans. Automat. Contr., vol.AC-25, p.1042-58, Dec. 1980) can be used to prove convergence of some adaptive infinite impulse response (IIR) filtering algorithms. The association of the algorithms with some ordinary differential equations for constant gains, which parallels the theory of L. Ljung et al. (1983), is suitable for constant-gain adaptive filtering applications. Convergence proofs for a prefiltering algorithm, for a simple constant-gain version of the recursive maximum-likelihood algorithm, and for the well-known simple hyperstable adaptive recursive filter (SHARF) algorithm are given as examples
Published in:
Information Theory, IEEE Transactions on
(Volume:34
,
Issue:
4
)
Date of Publication: Jul 1988
- Page(s):
- 692 - 709
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 3322547
- Digital Object Identifier :
- 10.1109/18.9769
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Jul 1988
- Sponsored by :
- IEEE Information Theory Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
