Abstract
The classical learning algorithms for adaptive IIR filtering, such as Gradient-descent algorithm and Least Square Techniques, suffer from several weaknesses. First, the convergence time is too long even for low order filters. Second, the algorithms fail to converge to the global optimum when the error function is multimodal. To tackle the above difficulties, a new learning algorithm for adaptive IIR filtering is proposed. In this paper, the genetic search is introduced into the gradient-descent algorithm, such as the Least-Mean-Square (LMS) algorithm, so as to provide global search capability and to further improve its convergence speed. In addition, the new algorithm is also applied to lattice structure of IIR filters for providing a more stable behavior.
| Original language | English |
|---|---|
| Article number | 390079 |
| Pages (from-to) | 105-108 |
| Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
| Volume | 3 |
| DOIs | |
| Publication status | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Conference on Acoustics, Speech and Signal Processing. Part 2 (of 6) - Adelaide, Aust Duration: 19 Apr 1994 → 22 Apr 1994 |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Fingerprint
Dive into the research topics of 'Fast convergent genetic search for adaptive IIR filtering'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver