Faculty of Information Technology, BUT

Publication Details

Recent Advances in Evolutionary Synthesis and Optimization of Ordinary and Polymorphic Circuits

GAJDA Zbyšek and SEKANINA Lukáš. Recent Advances in Evolutionary Synthesis and Optimization of Ordinary and Polymorphic Circuits. Brno: Faculty of Information Technology BUT, 2011. ISBN 978-80-214-4417-1.
Czech title
Nové přístupy v evoluční syntéze a optimalizaci běžných a polymorfních obvodů
Type
monograph
Language
english
Authors
Keywords
Polymorphic gate, polymorphic circuit, digital circuit design, evolutionary design, evolutionary optimization, Cartesian Genetic Programming
Abstract
This monograph deals with the evolutionary design and optimization of ordinary and polymorphic circuits. New extensions of Cartesian Genetic Programming (CGP) that allow reducing of the computational time and obtaining more compact circuits are proposed and evaluated. Second part of the thesis is focused on new methods for synthesis of polymorphic circuits. Proposed methods, based on polymorphic binary decision diagrams and polymorphic multiplexing, extend the ordinary circuit representations with the aim of including polymorphic gates. In order to reduce the number of gates in circuits synthesized using proposed methods, an evolutionary optimization based on CGP is implemented and evaluated. The implementations of polymorphic circuits optimized by CGP represent the best known solutions if the number of gates is considered as the target criterion.
Published
2011
Pages
111
ISBN
978-80-214-4417-1
Publisher
Faculty of Information Technology BUT
Place
Brno, CZ
BibTeX
@BOOK{FITPUB9908,
   author = "Zby\v{s}ek Gajda and Luk\'{a}\v{s} Sekanina",
   title = "Recent Advances in Evolutionary Synthesis and Optimization of Ordinary and Polymorphic Circuits",
   pages = 111,
   year = 2011,
   location = "Brno, CZ",
   publisher = "Faculty of Information Technology BUT",
   ISBN = "978-80-214-4417-1",
   language = "english",
   url = "https://www.fit.vut.cz/research/publication/9908"
}
Back to top