Boolean Minimizer FC-Min: Coverage Finding Process
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F04%3A03099646" target="_blank" >RIV/68407700:21230/04:03099646 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Boolean Minimizer FC-Min: Coverage Finding Process
Original language description
This paper describes the principles of a novel two level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a reverse way than common minimizers do.
Czech name
Není k dispozici
Czech description
Není k dispozici
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F04%2F2137" target="_blank" >GA102/04/2137: Design of highly reliable control systems built on dynamically reconfigurable FPGAs.</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2004
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
EUROMICRO Symposium on Digital System Design
ISBN
0-7695-2203-3
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
152-159
Publisher name
IEEE
Place of publication
Piscataway
Event location
Rennes
Event date
Aug 31, 2004
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—