This HTML5 document contains 49 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n14http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
n5http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n4http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F06%3A03121023%21RIV07-GA0-21230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F06%3A03121023%21RIV07-GA0-21230___
rdf:type
n8:Vysledek skos:Concept
dcterms:description
A method allowing us to efficiently group the multi-output Boolean function outputs is presented in this paper. Some kind of decomposition is usually involved in the logic synthesis process. Here the circuit has to be repeatedly divided into subcircuits, until these subcircuits become technological library elements or technology-dependent components, in general. Our output grouping method can be used to compute which functions of a set of Boolean functions could share most of logic. This idea can be exploited in single-level decomposition, where a two-level multi-output circuit is divided into several stand-alone blocks, while retaining their two-level nature. The total size of these circuits should be kept minimal. After such single-level decomposition the circuits are further processed by a common synthesis process. Není k dispozici A method allowing us to efficiently group the multi-output Boolean function outputs is presented in this paper. Some kind of decomposition is usually involved in the logic synthesis process. Here the circuit has to be repeatedly divided into subcircuits, until these subcircuits become technological library elements or technology-dependent components, in general. Our output grouping method can be used to compute which functions of a set of Boolean functions could share most of logic. This idea can be exploited in single-level decomposition, where a two-level multi-output circuit is divided into several stand-alone blocks, while retaining their two-level nature. The total size of these circuits should be kept minimal. After such single-level decomposition the circuits are further processed by a common synthesis process.
dcterms:title
Není k dispozici Output Grouping Method Based on a Similarity of Boolean Functions Output Grouping Method Based on a Similarity of Boolean Functions
skos:prefLabel
Output Grouping Method Based on a Similarity of Boolean Functions Není k dispozici Output Grouping Method Based on a Similarity of Boolean Functions
skos:notation
RIV/68407700:21230/06:03121023!RIV07-GA0-21230___
n3:strany
107 ; 113
n3:aktivita
n18:P n18:Z
n3:aktivity
P(GA102/04/0737), Z(MSM6840770014)
n3:dodaniDat
n16:2007
n3:domaciTvurceVysledku
n10:7140827 n10:2194937 n10:7205651
n3:druhVysledku
n9:D
n3:duvernostUdaju
n21:S
n3:entitaPredkladatele
n4:predkladatel
n3:idSjednocenehoVysledku
491217
n3:idVysledku
RIV/68407700:21230/06:03121023
n3:jazykVysledku
n7:eng
n3:klicovaSlova
Minimization, decomposition, on-line testing
n3:klicoveSlovo
n13:on-line%20testing n13:Minimization n13:decomposition
n3:kontrolniKodProRIV
[E929693F0EA9]
n3:mistoKonaniAkce
Freiberg
n3:mistoVydani
Freiberg
n3:nazevZdroje
Proceedings of the 7th International Workshop on Boolean Problems
n3:obor
n20:JC
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
3
n3:projekt
n11:GA102%2F04%2F0737
n3:rokUplatneniVysledku
n16:2006
n3:tvurceVysledku
Kubátová, Hana Kubalík, Pavel Fi1er, Petr
n3:typAkce
n17:WRD
n3:zahajeniAkce
2006-09-21+02:00
n3:zamer
n5:MSM6840770014
s:numberOfPages
7
n14:hasPublisher
Technische Universität Bergakademie
n19:isbn
3-86012-287-8
n6:organizacniJednotka
21230