Abstract
An evolutionary algorithm able to synthesize low-sensitivity digital filters using a chromosome coding scheme based on the adjacency matrix is proposed. It is shown that the proposed representation is more flexible than GP-tree schemes and has a higher search space dimension.
Keywords
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
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Koza, J.R., et al.: Use of Automatically Defined Functions and Architecture-Altering Operations in Automated Circuit Synthesis with Genetic Programming. In: Proc. of the First Annual Conference (1996)
Poli, R.: Evolution of graph-like programs with parallel distributed genetic programming. In: Proc. of the 7th International Conference on Genetic Algorithms, pp. 346–353 (1997)
Miller, J.F., Thomson, P.: Cartesian Genetic Programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121–132. Springer, Heidelberg (2000)
Mesquita, A., Salazar, F.A., Canazio, P.P.: Chromosome Representation through Adjacency Matrix in Evolutionary Circuits Synthesis. In: Proc. of the 2002 NASA/DoD Conference on Evolvable Hardware, pp. 102–109. IEEE Computer Press, Alexandria (2002)
Swamy, M.N.S., Thulasiraman, K.: Graphs, Networks and Algorithms. John Wiley & Sons, Chichester (1981)
Sapargaliyev, Y., Kalganova, T.: Constrained and Unconstrained evolution of LCR lowpass filters with oscillating length representation. IEEE Congress on Evol. Comput., 1529–1536 (2006)
Oppenheim, A.V., Schafer, R.W.: Digital Signal Processing. Prentice-Hall International, London (1975)
Warshall, S.: A Theorem on Boolean Matrices. Journal ACM 9, 11–12 (1962)
Uesaka, K., Kawamata, M.: Evolutionary Synthesis of Digital Filter Structures Using Genetic Programming. IEEE Trans. Cir. and Syst. II 50, 977–983 (2003)
Uesaka, K., Kawamata, M.: Synthesis of low-sensitivity second-order digital filters using genetic programming with automatically defined functions. IEEE Signal Processing Lett. 7, 83–85 (2000)
Crochiere, R.E., Oppenheim, A.V.: Analysis of linear digital networks. In: Proc. IEEE, vol. 63, pp. 581–595 (1975)
Zebulum, R.S., Pacheco, M.A.C., Vellasco, M.M.B.R.: Evolutionary Electronics - Automatic Design of Electronic Circuits and Systems by Genetic Algorithms. CRC Press, Boca Raton (2001)
Diniz, P.S.R., Antoniou, A.: Low-sensitivity digital-filter structures which are amenable to error spectrum shaping. IEEE Trans. Circuits Syst. 32, 1000–1007 (1985)
Kawamata, M., Iwatsuki, M., Higuchi, T.: Balanced realizations as minimum sensitivity structures in linear systems. Trans. Soc. Instrum. Contr. Eng. 21, 900–906 (1985)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sá, L., Mesquita, A. (2008). Digital Filters Using Adjacency Matrix Representation. In: Gelbukh, A., Morales, E.F. (eds) MICAI 2008: Advances in Artificial Intelligence. MICAI 2008. Lecture Notes in Computer Science(), vol 5317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88636-5_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-88636-5_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88635-8
Online ISBN: 978-3-540-88636-5
eBook Packages: Computer ScienceComputer Science (R0)