By Topic

The Application of the Rademacher–Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis

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
$33 $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

1 Author(s)
C. R. Edwards ; School of Electrical Engineering, University of Bath

Five operations are defined in the Rademacher-Walsh transform domain. It is shown that these operations allow Boolean functions to be classified in a very concise way. The result of applying this classification to Boolean functions of up to fourth order indicates that threshold functions play an important part in the composition of Boolean functions. A synthesis method is developed for the synthesis of any Boolean function using, as a basic element, an "optimized universal threshold logic gate." This gate overcomes the analog threshold tolerancing problems encountered in other threshold gate designs and is readily fabricated in an integrated circuit form. The use of this gate in logic design is expected to provide a considerable cost-saving over conventional methods.

Published in:

IEEE Transactions on Computers  (Volume:C-24 ,  Issue: 1 )