MAJORITY GATE NETWORKS
Abstract
The problem of majority gate networks is discussed. A majority network of order n has (2n-1) inputs and produces an output (it fires) when n of its inputs are excited (are fired). The problem of constructing such a network from smaller majority gates arises because in a large number of cases the network is not physically realizable with a single (2n-1) input gate; this is due to the limited signal resolution possible in a practical electronic device. Suppose someone were to develop an extensive body of logical design theory employing fiveinput majority gates; and suppose a very fast device were developed which acted also as a majority gate, but could accept only three inputs reliably. Clearly, then, an appropriate answer to the problem that we have posed previously might allow direct application of the new device in already familiar networks. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 24, 1961
- Accession Number
- AD0268907
Entities
People
- G. Cooke
- R.o. Winder
- S. Amarel
Organizations
- Sarnoff Corporation