Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Falkowski, B.J. ; Nanyang Technol. Univ. ; Shixing Yan

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 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.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:54 ,  Issue: 8 )