ON THE REALIZATION OF BINARY SWITCHING FUNCTIONS WITH MAJORITY GATES,
Abstract
For switching circuit design with majority gates, an augmented function is derived that permits the residue test to determine which of the constants 0 and 1 as well as which of the literals of a binary switching function must appear as inputs in a realization. An approach to the realization of switching functions with majority gates based on having only these required literals and constants as inputs is shown to be useful. A synthesis procedure employing this approach is presented that yields an upper bound on the number of stages required. A table is derived of all switching functions which may be realized with a network composed of two stages of three-input majority gates. A single function type obtained from the table demonstrates, however, that an optimal realization (defined as that network having the fewest gates of those having the smallest number of stages) with one type of majority gate cannot always be found if inputs are restricted to be required literals and constants. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 30, 1964
- Accession Number
- AD0609504
Entities
People
- Manush Raship
Organizations
- New York University