Title :
Identification of strong (weak) complete sets of logic primitives and their application in the realization of arbitrary switching functions
Author :
Deshmuhk, R.G. ; Promva, S.
Author_Institution :
Dept. of Electr. Eng., Florida Inst. of Technol., Melbourne, FL, USA
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
Keywords :
combinatorial circuits; combinatorial switching; arbitrary combinational switching functions; computer programs; logic primitives; strong complete sets identification; weak complete sets identification; Application software; Combinational circuits; Input variables; Integrated circuit interconnections; Logic gates; Testing;
Conference_Titel :
Southeastcon '90. Proceedings., IEEE
Conference_Location :
New Orleans, LA
DOI :
10.1109/SECON.1990.117919
