A novel paired Haar based transform: algorithms and interpretations in Boolean domain

A concept of paired Haar transform for Boolean functions has been introduced. By carrying additional information about the original functions such a transform can be efficiently used in analysis, synthesis, and testing of logic circuits. Mutual relations between new and known transforms used in logic design have been investigated. The meaning of Haar spectral coefficients in classical logic terms (minterms) has been shown.<>