A fast computer implementation of adding and arithmetic multi-polarity transforms for logic design
I. Schäfer, B.J. Falkowski, Marek A. Perkowski · 2002
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.>