DC FieldValueLanguage
dc.contributor.authorStanković, Radomiren
dc.date.accessioned2020-05-01T20:29:14Z-
dc.date.available2020-05-01T20:29:14Z-
dc.date.issued2004-08-23en
dc.identifier.issn1542-3980en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2098-
dc.description.abstractIn this paper, we define Arithmetic Transform TDDs (AC-TDDs) as a word-level counterpart of EXOR-TDDs. We discuss relationships and differences with the Arithmetic TDDs (Arith-TDDs). Then, we pointed out that from AC-TDDs we can read all the arithmetic polynomial expressions for switching functions. We show that, unlike other TDDs, single root AC-TDDs can be used to represent multi-output functions. We also show that AC-TDDs can be used for exact minimization of Fixed-polarity Arithmetic expressions in the same way as EXOR-TDDs can be used for minimization of Fixed-polarity Reed-Muller expressions.en
dc.publisherOld City Publishing-
dc.relation.ispartofJournal of Multiple-Valued Logic and Soft Computingen
dc.titleArithmetic transform ternary decision diagrams for exact minimization of fixed-polarity arithmetic expressionsen
dc.typeArticleen
dc.identifier.scopus2-s2.0-4043182897en
dc.relation.firstpage287en
dc.relation.lastpage307en
dc.relation.issue3en
dc.relation.volume10en
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
item.openairetypeArticle-
Show simple item record

SCOPUSTM   
Citations

2
checked on Oct 18, 2024

Page view(s)

13
checked on Oct 17, 2024

Google ScholarTM

Check


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