Referenced Items are not available for this document.
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
- Page(s):
- V-753 - V-756 vol.5
- Print ISBN:
- 0-7803-7448-7
- INSPEC Accession Number:
- 7454591
- Digital Object Identifier :
- 10.1109/ISCAS.2002.1010813
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
