This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimum Two-Level Threslold Gate Realizations
October 1972 (vol. 21 no. 10)
pp. 1086-1098
B.D. Carroll, Department of Electric Engineering, Auburn University
This paper deals with the synthesis of two-level networks of threshold gate logic elements for realization of nonlinearly separable switching functions. The realization obtained contains the minimum number of threshold logic elements possible for a two-level realization. An algorithm based on the tree procedure of Coates and Lewis is developed which can be used to obtain the desired network realization for a given switching function. The function may be incompletely specified.
Index Terms:
Algorithms, computers, minimal realizations, nonlinearly separable functions, switching theory, threshold logic.
Citation:
B.D. Carroll, C.L. Coates, "Minimum Two-Level Threslold Gate Realizations," IEEE Transactions on Computers, vol. 21, no. 10, pp. 1086-1098, Oct. 1972, doi:10.1109/T-C.1972.223455
Usage of this product signifies your acceptance of the Terms of Use.