Cart (Loading....) | Create Account
Close category search window

Comments on "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
$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

1 Author(s)
Yuen, C.-K. ; Department of Information Science, University of Tasmania

In the above paper1Edwards shows the implementation of several Boolean functions using a threshold gate and XOR gates. An unstated, but implicit, result is that any given Boolean function can be synthesized in this way. This result is of some historical interest. We wish to relate it to a previous paper by Kaplan and Winder [1], which in effect derived the result, and then to a mathematical study of Lawson [2], [3], which yields a synthesis procedure with very general applicability.

Published in:

Computers, IEEE Transactions on  (Volume:C-25 ,  Issue: 7 )

Date of Publication:

July 1976

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.