ON THE ANALYSIS AND SYNTHESIS OF SWITCHING NETWORKS COMPOSED OF M-OUT-OF-N DECISION GATES.

Abstract

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.

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1964
Accession Number
AD0604043

Entities

People

  • Manush Raship

Organizations

  • New York University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Boolean Algebra
  • Inclusions
  • Logic
  • Switching

Readers

  • Computer Engineering
  • Graph Algorithms and Convex Optimization.
  • Team-Based Human-Centered Cognitive Task Decision Making and Information Performance.