The Community for Technology Leaders
Green Image
Issue No. 10 - October (1972 vol. 21)
ISSN: 0018-9340
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.
Algorithms, computers, minimal realizations, nonlinearly separable functions, switching theory, threshold logic.
B.D. Carroll, C.L. Coates, "Minimum Two-Level Threslold Gate Realizations", IEEE Transactions on Computers, vol. 21, no. , pp. 1086-1098, October 1972, doi:10.1109/T-C.1972.223455
87 ms
(Ver 3.3 (11022016))