By Topic

Algorithms for fast arithmetic transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Falkowski, B.J. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore

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.

Published in:

Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on  (Volume:5 )

Date of Conference:

2002