Identification of strong (weak) complete sets of logic primitives and their application in the realization of arbitrary switching functions

R.G Deshmuhk,S Promva

doi:10.1109/secon.1990.117919

Identification of strong (weak) complete sets of logic primitives and their application in the realization of arbitrary switching functions

R.G Deshmuhk, S Promva

https://doi.org/10.1109/secon.1990.117919

Copy DOI

Publication Date: Apr 1, 1990

Affiliation: Florida Institute of Technology

#Arbitrary Switching Functions #Combinational Switching Function + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

A method for the identification of strong (weak) complete sets of logic primitives and their application in the realization of arbitrary combinational switching functions are presented. Two computer programs are discussed. The first program takes as input the given combinational switching function or the set and tests it for a strong (weak) complete function or set. The same program tests the function or the set to determine whether it can form the strong (weak) basis. The second program can be used to realize any arbitrary switching function using the given function if it happens to be a strong complete function known from the first program. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.