Operations on logic functions and variables through sign Haar spectra

A non-linear transform, called “sign Haar transform” has recently been introduced. The transform is unique and converts binary/ternary vectors into ternary spectral domain. Recursive definitions for the calculation of sign Haar transform are developed. Essential properties of logic functions and variables in the spectral domain of a quantized transform based on Haar functions are presented. Sign Haar transform has the smallest computational cost of all the quantized transforms. The properties of logic functions are listed for two different codings of incompletely specified functions.