DocumentCode
3399816
Title
A fast computer implementation of adding and arithmetic multi-polarity transforms for logic design
Author
Schafer, Iwan ; Falkowski, Bogdan J. ; Perkowski, Marek A.
Author_Institution
Dept. of Electr. Eng., Portland State Univ., OR, USA
fYear
1991
fDate
14-17 May 1991
Firstpage
883
Abstract
A novel computer algorithm that generates adding and arithmetic multipolarity transforms of completely and incompletely specified Boolean functions is discussed. The algorithm generates the spectra directly from the minterm representation of a function without performing a matrix multiplication. When used for Boolean function transformations, these transforms are one-to-one mappings in a binary/ternary vector space
Keywords
Boolean functions; circuit CAD; digital arithmetic; logic CAD; Boolean functions; adding; arithmetic multi-polarity transforms; binary/ternary vector space; computer algorithm; logic design; minterm representation; one-to-one mappings; Algebra; Boolean functions; Cryptography; Digital arithmetic; Equations; Image coding; Logic design; Minimization; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on
Conference_Location
Monterey, CA
Print_ISBN
0-7803-0620-1
Type
conf
DOI
10.1109/MWSCAS.1991.252071
Filename
252071
Link To Document