Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
GAJDA, Z. SEKANINA, L.
Originální název
On Evolutionary Synthesis of Compact Polymorphic Combinational Circuits
Typ
článek v časopise - ostatní, Jost
Jazyk
angličtina
Originální abstrakt
Polymorphic gates are unconventional circuit components that are not supported by existing synthesis tools. This article presents 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 Cartesian Genetic Programming (CGP) is implemented. The implementations of polymorphic circuits optimized by CGP represent the best known solutions if the number of gates is considered as the decision criterion.
Klíčová slova
polymorphic circuit, digital circuit synthesis, evolutionary computing, genetic programming
Autoři
GAJDA, Z.; SEKANINA, L.
Rok RIV
2011
Vydáno
11. 5. 2011
ISSN
1542-3980
Periodikum
JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING
Ročník
17
Číslo
6
Stát
Spojené státy americké
Strany od
607
Strany do
631
Strany počet
25
URL
https://www.fit.vut.cz/research/publication/9621/
BibTex
@article{BUT76322, author="Zbyšek {Gajda} and Lukáš {Sekanina}", title="On Evolutionary Synthesis of Compact Polymorphic Combinational Circuits", journal="JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING", year="2011", volume="17", number="6", pages="607--631", issn="1542-3980", url="https://www.fit.vut.cz/research/publication/9621/" }