Abstract
In LMS algorithm of adaptive filter design, how to determine the learning step is an unpleasant problem. In this paper an application of Immune Algorithm (IA) to LMS Adaptive notch filter design is presented. The steps of the IA’s realization and the experimental data are shown with an example. The result of the experiment has shown that the IA can find the optimal learning step of the LMS adaptive notch filter and the convergent speed of algorithm is fast.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hofmeyr, S.A., Forrest, S.: Architecture for an Artificial Immune System. Evolutionary Computation 8, 443–473 (2000)
Farmer, J.D., Packard, N.H., Perelson, A.A.: The Immune System Adaption, and Machine Learning. Physica 22D, 187–204 (1986)
Gao, Y., Xie, S.L.: A Variable Step Size LMS Adaptive Filtering Algorithm and Its Analysis. Acta Electronica Sinica 29, 1094–1097 (2001)
Chun, J.S., Lim, J.P., Jung, H.K.: Optimal Design of Synchronous Motor with Parameter Correction Using Immune Algorithm. IEEE Transactions on Energy Conversion 14, 610–615 (1999)
Jiao, L.C., Wang, L.: A Novel Genetic Algorithm Based on Immunity. IEEE Transaction on Systems, Man, and Cybernetics-Part A: Systems and Humans 30, 552–561 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X., Gao, J. (2004). LMS Adaptive Notch Filter Design Based on Immune Algorithm. In: Yin, FL., Wang, J., Guo, C. (eds) Advances in Neural Networks – ISNN 2004. ISNN 2004. Lecture Notes in Computer Science, vol 3173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28647-9_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-28647-9_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22841-7
Online ISBN: 978-3-540-28647-9
eBook Packages: Springer Book Archive