Ternary Walsh Transform and Its Operations for Completely and Incompletely Specified Boolean Functions

The new ternary Walsh transform is considered in this paper. Such a ternary Walsh transform can be used in a similar manner as the standard Walsh transform for binary logic functions as shown here. It is based on the Kronecker product as well as the Galois field (3) and new ternary operations. The same hardware implementation can be used for both forward and inverse ternary Walsh transforms based on its fast algorithms and properties. The ternary Walsh transform is suitable for processing both completely and incompletely specified Boolean functions. Its properties for the decomposition and symmetry detections of the Boolean functions are shown.