THEORY OF ADJUSTABLE SWITCHING NETWORKS
Abstract
Part 1 (Threshold Logic) consists of a comprehensive survey of threshold logic, a geometric result relevant to estimating the number of threshold functions, generalizations and strengthening of known bounds on the logical capabilities of threshold gate networks, computer-aided work on the realization of arbitrary functions by networks of three-input majority gates (including a list of realizations for every type of four-argument switching function), and a comparison of two methods for synthesis of very large threshold gates: the well-known Bayesian approach and a geometric alternative. The latter method is shown to be preferable. Part 2 (Reliability of Switching Networks) presents a survey of several important schemes for introducing redundancy into a combinational network for the improvement of reliability. Some extensions of the previous analyses of recursive triangles and initial results on the incorporation of memory and feedback to allow the use of fewer basic gates in a time-shared fashion.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 30, 1963
- Accession Number
- AD0414512
Entities
People
- C. V. Srinivasan
- R. O. Winder
- S. Amarel
- S. Y. Levy
Organizations
- Sarnoff Corporation