Title :
Algorithms for fast arithmetic transform
Author :
Falkowski, Bogdan J.
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
Abstract :
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.
Keywords :
Boolean functions; circuit CAD; decision diagrams; digital arithmetic; discrete transforms; integer programming; matrix decomposition; probabilistic logic; Boolean function arithmetic expansion; arbitrary polarity fast algorithms; decision diagrams; digital circuit CAD; discrete arithmetic expansion generation; factored matrices; fast arithmetic transform algorithms; integer representations; matrix properties; probabilistic expansions; square permutation matrices; Arithmetic; Boolean algebra; Boolean functions; Circuit synthesis; Circuit testing; Digital circuits; Discrete transforms; Integrated circuit interconnections; Planarization; Semiconductor device modeling;
Conference_Titel :
Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on
Print_ISBN :
0-7803-7448-7
DOI :
10.1109/ISCAS.2002.1010813
