Back to Search
Start Over
A Realization Procedure for Threshold Gate Networks
- Source :
- SWCT (FOCS)
- Publication Year :
- 1963
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 1963.
-
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.
- Subjects :
- Sequential logic
Generalization
Boolean circuit
Function (mathematics)
Theoretical Computer Science
Range (mathematics)
Computational Theory and Mathematics
Hardware and Architecture
Circuit minimization for Boolean functions
Network synthesis filters
Function tree
Boolean function
Realization (systems)
Algorithm
Software
Mathematics
Subjects
Details
- ISSN :
- 03677508
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Electronic Computers
- Accession number :
- edsair.doi.dedup.....b0f57b0c8bca831d0ed107ff6a8bd4d5
- Full Text :
- https://doi.org/10.1109/pgec.1963.263625