|
|
Evolutionary Approach to Synthesis and Optimization of Ordinary and Polymorphic Circuits
Gajda, Zbyšek ; Schmidt, Jan (oponent) ; Zelinka,, Ivan (oponent) ; Sekanina, Lukáš (vedoucí práce)
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 optimized by CGP represent the best known solutions if the number of gates is considered as the target criterion.
|
|
|
Polymorphic circuits synthesis and optimization
Crha, Adam ; Plíva, Zdeněk (oponent) ; Fišer, Petr (oponent) ; Růžička, Richard (vedoucí práce)
This thesis deals with synthesis and optimization methods of polymorphic circuits. Ordinary and multi-functional synthesis and optimization methods are discussed. The main objective of this thesis is to introduce novel methodologies for scalable synthesis of multi-functional digital circuits. Despite the fact that several approaches have been proposed during recent years, those are applicable for small-scale circuits only or are based on various evolution-inspired techniques. Obviously, scalable synthesis methodology for complex multi-functional circuits does not exist yet. The proposed methodology is based on And-Inverter Graphs ( AIGs ) with built-in extension for multi-functional circuits where the employment of rewriting techniques reduces the area by sharing common resources of two different input circuits. Experiments performed on publicly available benchmark circuits demonstrate significant optimization achievements.
|
|
| |
|
|
Celulární automat v evolučním procesu
Hejč, Michal ; Herrman, Tomáš (oponent) ; Bidlo, Michal (vedoucí práce)
Tato diplomová práce pojednává o využití evolučních algoritmů společně s technikou developmentu v celulárních automatech. Popisuje základní principy jednotlivých nástrojů a následně se zaměřuje na jednu specifickou oblast - návrh kombinačních logických obvodů. Pomocí genetického algoritmu je hledán neuniformní celulární automat, který slouží jako generátor výsledného obvodu. Jsou provedeny experimenty se základními typy kombinačních logických obvodů a se speciální třídou nazývanou polymorfní obvody. Na závěr jsou představeny dosažené výsledky a provedeno porovnání s uniformními celulárními automaty.
|
|
|
Polymorphic circuits synthesis and optimization
Crha, Adam ; Plíva, Zdeněk (oponent) ; Fišer, Petr (oponent) ; Růžička, Richard (vedoucí práce)
This thesis deals with synthesis and optimization methods of polymorphic circuits. Ordinary and multi-functional synthesis and optimization methods are discussed. The main objective of this thesis is to introduce novel methodologies for scalable synthesis of multi-functional digital circuits. Despite the fact that several approaches have been proposed during recent years, those are applicable for small-scale circuits only or are based on various evolution-inspired techniques. Obviously, scalable synthesis methodology for complex multi-functional circuits does not exist yet. The proposed methodology is based on And-Inverter Graphs ( AIGs ) with built-in extension for multi-functional circuits where the employment of rewriting techniques reduces the area by sharing common resources of two different input circuits. Experiments performed on publicly available benchmark circuits demonstrate significant optimization achievements.
|
|
|
Evolutionary Approach to Synthesis and Optimization of Ordinary and Polymorphic Circuits
Gajda, Zbyšek ; Schmidt, Jan (oponent) ; Zelinka,, Ivan (oponent) ; Sekanina, Lukáš (vedoucí práce)
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 optimized by CGP represent the best known solutions if the number of gates is considered as the target criterion.
|
|
| |
|
|
Celulární automat v evolučním procesu
Hejč, Michal ; Herrman, Tomáš (oponent) ; Bidlo, Michal (vedoucí práce)
Tato diplomová práce pojednává o využití evolučních algoritmů společně s technikou developmentu v celulárních automatech. Popisuje základní principy jednotlivých nástrojů a následně se zaměřuje na jednu specifickou oblast - návrh kombinačních logických obvodů. Pomocí genetického algoritmu je hledán neuniformní celulární automat, který slouží jako generátor výsledného obvodu. Jsou provedeny experimenty se základními typy kombinačních logických obvodů a se speciální třídou nazývanou polymorfní obvody. Na závěr jsou představeny dosažené výsledky a provedeno porovnání s uniformními celulárními automaty.
|
host ::
RSS.