A Realization Procedure for Threshold Gate Networks
- 1 October 1963
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-12 (5) , 454-461
- https://doi.org/10.1109/PGEC.1963.263625
Abstract
One engineering parameter of importance in the realization of threshold gate networks is the tolerance which must be placed on the coefficients and threshold of the individual components. A previous paper gives a realization procedure which allows this tolerance to be controlled. The present paper gives an alternate realization procedure which also allows the tolerance to be controlled, but which is somewhat different in its application. The new procedure can be considered to be a generalization of an earlier procedure for the single-element realization problem. The function is first decomposed using a generalization of the function tree and then reconstructed using a generalization of the range theorem plus some additional simplification theorems.Keywords
This publication has 6 references indexed in Scilit:
- Linearly separable switching functionsJournal of the Franklin Institute, 1961
- Linear-Input LogicIEEE Transactions on Electronic Computers, 1961
- Axiomatic Majority-Decision LogicIEEE Transactions on Electronic Computers, 1961
- The profile technique for the desing of threshold device logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1961
- More about threshold logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1961
- A Theorem for Deriving Majority-Logic Networks Within an Augmented Boolean AlgebraIEEE Transactions on Electronic Computers, 1960