DC FieldValueLanguage
dc.contributor.authorStanković, Radomiren
dc.contributor.authorStanković, Milenaen
dc.contributor.authorMoraga, Claudioen
dc.date.accessioned2020-05-01T20:29:17Z-
dc.date.available2020-05-01T20:29:17Z-
dc.date.issued2001-01-01en
dc.identifier.isbn978-0-7695-1083-3-
dc.identifier.issn0195-623Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2129-
dc.description.abstractIn spectral interpretation, decision diagrams (DDs) are defined in terms of some spectral transforms. For a given DD, the related transform is determined by an analysis of expansion rules used in the nodes and the related labels of edges. The converse task, design of a DD in terms of a given spectral transform often requires decomposition of basic functions in spectral transform to determine the corresponding expansion rules and labels at the edges. We point out that this problem relates to the assignment of nodes in Pseudo-Kronecker DDs (PKDDs). Due to that, we generalize the definition of Haar spectral transform DDs (HSTDDs) to multiple-valued (MV) functions. Conversely, front such defined HSTDDs, we derive various Haar transforms for MV functions.en
dc.publisherIEEE-
dc.relation.ispartofProceedings of The International Symposium on Multiple-Valued Logicen
dc.titleDesign of Haar wavelet transforms and Haar spectral transform decision diagrams for multiple-valued functionsen
dc.typeArticleen
dc.relation.conference31st IEEE International Symposium on Multiple-Valued Logic; 22-24 May 2001; Warsaw, Poland-
dc.identifier.doi10.1109/ISMVL.2001.924589en
dc.identifier.scopus2-s2.0-0034835171en
dc.relation.firstpage311en
dc.relation.lastpage316en
item.grantfulltextnone-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
Show simple item record

SCOPUSTM   
Citations

9
checked on Sep 7, 2024

Page view(s)

2
checked on Sep 7, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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