ON THE ANALYSIS AND SYNTHESIS OF SWITCHING NETWORKS COMPOSED OF M-OUT-OF-N DECISION GATES.
NEW YORK UNIV N Y LAB FOR ELECTROSCIENCE RESEARCH
Pagination or Media Count:
A formal algebra, called m-out-of-n decision logic, is developed for the analysis and synthesis of switching networks made up of m-out-of-n decision gates. An m-outof-n decision gate is defined as a device that can be described by a threshold function whose weights and threshold are positive integers. Such a threshold function is also referred to as an m-out-of-n decision function. A set of theorems is derived from an axiom set, and the inclusion of Boolean algebra and 3-input majority-decision logic as special cases of the m-out-of-n decision logic is demonstrated.