Technique for implementing arbitrary Boolean functions in threshold logic

Peter Celinski; Gregory D. Sherman; Derek Abbott

doi:10.1117/12.418772

16 March 2001 Technique for implementing arbitrary Boolean functions in threshold logic

Peter Celinski, Gregory D. Sherman, Derek Abbott

Proceedings Volume 4236, Smart Electronics and MEMS II; (2001) https://doi.org/10.1117/12.418772
Event: Smart Materials and MEMS, 2000, Melbourne, Australia

Abstract

The main result of this paper is the development of a systematic paper-and-pencil design methodology for implementing Boolean functions of up to 4 variables using threshold logic (TL) gates, which does not require linear programming, for the first time. The method is similar in operation to the Karnaugh map logic minimization technique, and is based on determining the minimum threshold cover of a Boolean function. The paper also reviews aspects of TL and discusses aspects of the proposed design methodology when combined with the implementation issues present in neuron-MOS based TL gates. Two circuit design examples using the proposed technique are given.

Citation Download Citation

Peter Celinski, Gregory D. Sherman, and Derek Abbott "Technique for implementing arbitrary Boolean functions in threshold logic", Proc. SPIE 4236, Smart Electronics and MEMS II, (16 March 2001); https://doi.org/10.1117/12.418772

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available