- author = "Zbysek Gajda",
- title = "Evolutionary Approach to Synthesis and Optimization of Ordinary and Polymorphic Circuits",
- title_cz = "Evolu{\v{c}}n{\'{\i}} p{\v{r}}{\'{\i}}stup k synt{\'{e}}ze a optimalizaci b{\v{e}}{\v{z}}n{\'{y}}ch a polymorfn{\'{\i}}ch obvod{\r{u}}",
- school = "Brno University of Technology",
- year = "2011",
- address = "Bruno, Czech Republic",
- keywords = "genetic algorithms, genetic programming, Cartesian Genetic Programming, Polymorphic gate, polymorphic circuit, digital circuit design, evolutionary design, evolutionary optimization",
- timestamp = "Wed, 04 May 2022 13:00:16 +0200",
-
biburl = "
https://dblp.org/rec/phd/basesearch/Gajda11.bib",
- bibsource = "dblp computer science bibliography, https://dblp.org",
-
URL = "https://hdl.handle.net/11012/63257",
-
URL = "https://dspace.vutbr.cz/handle/11012/63257",
-
URL = "https://www.vut.cz/www_base/zav_prace_soubor_verejne.php?file_id=136902",
- size = "96 pages",
- abstract = "This thesis 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 optimised by CGP represent the best known solutions if the number of gates is considered as the target criterion.",
-
notes = "In English
Supervisor: Lukas Sekanina",
