DC Field | Value | Language |
---|---|---|
dc.contributor.author | Stanković, Radomir | en |
dc.date.accessioned | 2020-05-01T20:29:14Z | - |
dc.date.available | 2020-05-01T20:29:14Z | - |
dc.date.issued | 2004-08-23 | en |
dc.identifier.issn | 1542-3980 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/2098 | - |
dc.description.abstract | In 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.publisher | Old City Publishing | - |
dc.relation.ispartof | Journal of Multiple-Valued Logic and Soft Computing | en |
dc.title | Arithmetic transform ternary decision diagrams for exact minimization of fixed-polarity arithmetic expressions | en |
dc.type | Article | en |
dc.identifier.scopus | 2-s2.0-4043182897 | en |
dc.relation.firstpage | 287 | en |
dc.relation.lastpage | 307 | en |
dc.relation.issue | 3 | en |
dc.relation.volume | 10 | en |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
SCOPUSTM
Citations
2
checked on Nov 19, 2024
Page view(s)
18
checked on Nov 19, 2024
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.