Abstract
High Level Synthesis (HLS)is a designing methodology aimed to the synthesis of RT-level hardware devices from behavioral development specifications. In this work we present an evolutionary algorithm in order to optimize circuit specifications by means of a special type of genetic operator. We have named this operator algebraic mutation, carried out with the help of algebraic equations. This work can be classified within the development of an automatic tool of Formal Synthesis by using genetic techniques. We have applied this technique to a simple circuit equational specification and to a much more complex algebraic equation. In the first case our algorithm simplifies the equation until the best specification is found and in the second a solution improving the former is always obtained.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
W. Banzhaf, P. Nordin, R.E. Keller and F.D. Francone, Genetic Programming An introduction. On the Automatic Evolution of Computer Programs and Its Applications, Morgan Kaufmann, dpunkt.verlag, 1998.
CCITT, Adaptative differential pulse code modulation (ADPCM), Rec.G.721, Fascicle III. 4, 1998.
K. Chellapilla, Evolving Computer Programs Without Subtree Crossover, IEEE Transactions on Evolutionary Computation, 1(3):209–216 1997.
J. I. Hidalgo, Técnicas de partición y Ubicación para Sistemas Multi-FPGA basadas en Algoritmos Genéticos, Tesis doctoral, noviembre 2001.
J. R. Koza, Genetic Programming:On the programming of Computers by Means of natural Selection, MIT Press, Cambridge MA, 1992.
J. M. Mendías, R. Hermida, M. Fernández Correct High-Level Synthesis:a Formal Perspective, in Proc. of Design, Automation and Test in Europe, DATE’ 98.
J. M. Mendías, R.Hermida, M. Fernández Formal Techniques for Hardware Allocation, Proc. of 10th International Conference on VLSI Design, VLSI’ 97.
R. Poli, W.B. Langdon, On the Search Properties of Different Crossover Operators in Genetic Programming, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 293–301.
T. Weinbrenner, Genetic programming kernel Version 0.5.2 C++Class Library, http://thor.emk.e-thecnik.tu-darmstadt.de/~thomasw/gpkernel1.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ibarra, A., Lanchares, J., Mendias, J.M., Hidalgo, J.I., Hermida, R. (2002). Transformation of Equational Specification by Means of Genetic Programming. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A. (eds) Genetic Programming. EuroGP 2002. Lecture Notes in Computer Science, vol 2278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45984-7_24
Download citation
DOI: https://doi.org/10.1007/3-540-45984-7_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43378-1
Online ISBN: 978-3-540-45984-2
eBook Packages: Springer Book Archive