Semiconductor & Computer Engineering
From WikiChip
Difference between revisions of "boolean algebra/majority function"
(Created page with "'''Majority function''' (sometimes '''quorum function''') is a threshold function that produces a 1 if and only if the majority of the inputs are 1. Otherwise, the output...") |
|||
| Line 10: | Line 10: | ||
A 3-input majority function can be implemented using the following Boolean function <math>\text{MAJ}(x,y,z) = (x \land y) \oplus (x \land z) \oplus (y \land z)</math>. | A 3-input majority function can be implemented using the following Boolean function <math>\text{MAJ}(x,y,z) = (x \land y) \oplus (x \land z) \oplus (y \land z)</math>. | ||
| + | |||
| + | == Majority gate == | ||
| + | {{main|majority gate}} | ||
| + | The '''[[majority gate]]''' is a [[logic gate]] that implements the majority function as a circuit. | ||
| + | |||
| + | == See also == | ||
| + | * [[threshold function]] | ||
Revision as of 23:39, 23 November 2015
Majority function (sometimes quorum function) is a threshold function that produces a 1 if and only if the majority of the inputs are 1. Otherwise, the output is 0. This function is only defined for three or more odd inputs. The majority function can be found in various applications such as adders, subtractors, hash functions, and Muller C-element.
A 3-input majority function can be implemented using the following Boolean function .
Majority gate
- Main article: majority gate
The majority gate is a logic gate that implements the majority function as a circuit.