Skip to Main Content
Fast arithmetic transforms are used in the generation of discrete arithmetic expansions of Boolean functions that are their integer representations such as probabilistic expansions, decision diagrams, etc. In this article, new properties of factored and permutation matrices for fast Arithmetic transforms have been introduced. Different algorithms to generate the square permutation matrices being the basis of fast algorithms for an arbitrary polarity of arithmetic expansions have also been shown.
Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on (Volume:5 )
Date of Conference: 2002