DC FieldValueLanguage
dc.contributor.authorDrechsler, Rolfen
dc.contributor.authorJanković, Draganen
dc.contributor.authorStanković, Radomiren
dc.date.accessioned2020-05-01T20:29:13Z-
dc.date.available2020-05-01T20:29:13Z-
dc.date.issued2005-04-07en
dc.identifier.issn1542-3980en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2093-
dc.description.abstractThis paper presents a generic approach to implementation of Decision Diagrams (DDs) for representation and manipulation of Multi-Valued Logic (MVL) functions. The core package is based on recursive synthesis operations, where the recursive step is given by a table look-up technique. This allows to simply exchange the decomposition type without reimplementation of the complete program. The approach can easily be used for prototyping of MVL DD packages. We investigate the problem from a theoretical point of view, i.e. several decompositions that can be realized using the technique are given. Experimental results are reported to demonstrate the efficiency of the approach.en
dc.publisherOld City Publishing-
dc.relation.ispartofJournal of Multiple-Valued Logic and Soft Computingen
dc.subjectDecision diagram | Implementation | Logic synthesis | Verification | VLSI CADen
dc.titleGeneric implementation of multi-valued logic decision diagram packagesen
dc.typeArticleen
dc.identifier.scopus2-s2.0-15744373807en
dc.relation.firstpage1en
dc.relation.lastpage18en
dc.relation.issue1-2en
dc.relation.volume11en
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.grantfulltextnone-
item.fulltextNo Fulltext-
Show simple item record

SCOPUSTM   
Citations

2
checked on Nov 19, 2024

Page view(s)

17
checked on Nov 19, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.