About: On Area Minimization of Complex Combinational Circuits Using Cartesian Genetic Programming

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On Area Minimization of Complex Combinational Circuits Using Cartesian Genetic Programming Goto Sponge Distinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	The paper deals with the evolutionary post synthesis optimization of complex combinational circuits with the aim of reducing the area on a chip as much as possible. In order to optimize complex circuits, Cartesian Genetic Programming (CGP) is employed where the fitness function is based on a formal equivalence checking algorithm rather than evaluating all possible input assignments. The standard selection strategy of CGP is modified to be more explorative and so agile in very rugged fitness landscapes. It was shown on the LGSynth93 benchmark circuits that the modified selection strategy leads to more compact circuits in roughly 50% cases. The average area improvement is 24% with respect to the results of conventional synthesis. Delay of optimized circuits was also analyzed. The paper deals with the evolutionary post synthesis optimization of complex combinational circuits with the aim of reducing the area on a chip as much as possible. In order to optimize complex circuits, Cartesian Genetic Programming (CGP) is employed where the fitness function is based on a formal equivalence checking algorithm rather than evaluating all possible input assignments. The standard selection strategy of CGP is modified to be more explorative and so agile in very rugged fitness landscapes. It was shown on the LGSynth93 benchmark circuits that the modified selection strategy leads to more compact circuits in roughly 50% cases. The average area improvement is 24% with respect to the results of conventional synthesis. Delay of optimized circuits was also analyzed. (en)
Title	On Area Minimization of Complex Combinational Circuits Using Cartesian Genetic Programming On Area Minimization of Complex Combinational Circuits Using Cartesian Genetic Programming (en)
skos:prefLabel	On Area Minimization of Complex Combinational Circuits Using Cartesian Genetic Programming On Area Minimization of Complex Combinational Circuits Using Cartesian Genetic Programming (en)
skos:notation	RIV/00216305:26230/12:PU101751!RIV13-GA0-26230___
http://linked.open...avai/predkladatel	Fakulta informačních technologií
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(ED1.1.00/02.0070), P(GAP103/10/1517), S, Z(MSM0021630528)
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Vašíček, Zdeněk Sekanina, Lukáš
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoké učení technické v Brně / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	156181
http://linked.open...ai/riv/idVysledku	RIV/00216305:26230/12:PU101751
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	logic synthesis, optimization, genetic programming, selection (en)
http://linked.open.../riv/klicoveSlovo	optimization selection genetic programming logic synthesis
http://linked.open...ontrolniKodProRIV	[9575EB3C47B1]
http://linked.open...v/mistoKonaniAkce	Brisbane
http://linked.open...i/riv/mistoVydani	CA
http://linked.open...i/riv/nazevZdroje	2012 IEEE World Congress on Computational Intelligence
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	IT4Innovations Centre of Excellence Natural Computing on Unconventional Platforms
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Sekanina, Lukáš Vašíček, Zdeněk
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000312859303081
http://linked.open.../riv/zahajeniAkce	2012-06-10 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum informačních technologií z hlediska bezpečnosti
number of pages	6 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/CEC.2012.6256649
http://purl.org/ne...btex#hasPublisher	Institute of Electrical and Electronics Engineers
https://schema.org/isbn	978-1-4673-1508-1
http://localhost/t...ganizacniJednotka	26230
is http://linked.open...avai/riv/vysledek of	On Area Minimization of Complex Combinational Circuits Using Cartesian Genetic Programming

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software