About: On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming

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

About: On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming Goto Sponge NotDistinct 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	Recently, it has been shown that synthesis of some circuits is quite difficult for conventional methods. In this paper we present a method of minimization of multi-level logic networks which can solve these difficult circuit instances. The synthesis problem is transformed on the search problem. A search algorithm called Cartesian genetic programming (CGP) is applied to synthesize various difficult circuits. Conventional circuit synthesis usually fails for these difficult circuits; specific synthesis processes must be employed to obtain satisfactory results. We have found that CGP is able to implicitly discover new efficient circuit structures. Thus, it is able to optimize circuits universally, regardless their structure. The circuit optimization by CGP has been found especially efficient when applied to circuits already optimized by a conventional synthesis. The total runtime is reduced, while the result quality is improved further more. Recently, it has been shown that synthesis of some circuits is quite difficult for conventional methods. In this paper we present a method of minimization of multi-level logic networks which can solve these difficult circuit instances. The synthesis problem is transformed on the search problem. A search algorithm called Cartesian genetic programming (CGP) is applied to synthesize various difficult circuits. Conventional circuit synthesis usually fails for these difficult circuits; specific synthesis processes must be employed to obtain satisfactory results. We have found that CGP is able to implicitly discover new efficient circuit structures. Thus, it is able to optimize circuits universally, regardless their structure. The circuit optimization by CGP has been found especially efficient when applied to circuits already optimized by a conventional synthesis. The total runtime is reduced, while the result quality is improved further more. (en)
Title	On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming (en)
skos:prefLabel	On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming On Logic Synthesis of Conventionally Hard to Synthesize Circuits Using Genetic Programming (en)
skos:notation	RIV/68407700:21240/10:00167768!RIV14-MSM-21240___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GA102/09/1668), Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Fišer, Petr Schmidt, Jan
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	České vysoké učení technické v Praze / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	276742
http://linked.open...ai/riv/idVysledku	RIV/68407700:21240/10:00167768
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	logic synthesis; multi-level network; genetic programming (en)
http://linked.open.../riv/klicoveSlovo	genetic programming logic synthesis multi-level network
http://linked.open...ontrolniKodProRIV	[C063DB887B48]
http://linked.open...v/mistoKonaniAkce	Vienna
http://linked.open...i/riv/mistoVydani	Piscataway
http://linked.open...i/riv/nazevZdroje	Proc. of the 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	SoC circuits reliability and availability improvement
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Fišer, Petr Schmidt, Jan Vašíček, Z. Sekanina, L.
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2010-04-14 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií
number of pages	6 (xsd:int)
http://bibframe.org/vocab/doi	10.1109/DDECS.2010.5491755
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4244-6613-9
http://localhost/t...ganizacniJednotka	21240

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, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software