DC FieldValueLanguage
dc.contributor.authorJanković, Draganen
dc.contributor.authorStanković, Radomiren
dc.contributor.authorDrechsler, Rolfen
dc.date.accessioned2020-05-01T20:29:15Z-
dc.date.available2020-05-01T20:29:15Z-
dc.date.issued2002-01-01en
dc.identifier.isbn978-0-769-51790-0en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2118-
dc.description.abstractIn this paper, we propose an approach to the reduction of sizes of multi-terminal binary decision diagrams (MTBDDs) by using the copy properties of discrete functions. The underlying principles come from copy theory of discrete signals considered previously. We propose two modifications of MTBDDs, called copy DDs (CDDs) and half copy DDs (HCDDs), using the corresponding copy operations from copy theory. Functions having different types of copy properties can be efficiently represented by the proposed Copy DDs. Examples are Walsh and Reed-Muller functions as well as different binary codes.en
dc.publisherIEEE-
dc.relation.ispartofProceedings - Euromicro Symposium on Digital System Design: Architectures, Methods and Tools, DSD 2002en
dc.subjectArithmetic | Binary codes | Binary decision diagrams | Boolean functions | Computer science | Data structures | Decision trees | Libraries | Logicen
dc.titleDecision diagram optimization using copy propertiesen
dc.typeConference Paperen
dc.relation.conferenceEuromicro Symposium on Digital System Design, DSD 2002; Dortmund; Germany; 4 September 2002 through 6 September 2002-
dc.identifier.doi10.1109/DSD.2002.1115374en
dc.identifier.scopus2-s2.0-84949661240en
dc.relation.firstpage236en
dc.relation.lastpage243en
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeConference Paper-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
Show simple item record

SCOPUSTM   
Citations

3
checked on Nov 24, 2024

Page view(s)

17
checked on Nov 24, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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