xor gate using minimum number of nand gates is four.
xor gate using minimum number of nand gates is four.
xor gate using minimum number of nand gates?
four
an xor gate circuit can be made from four nand gates. in fact, both nand and nor gates are so-called "universal gates" and any logical function can be constructed from either nand logic or nor logic alone. if the four nand gates are replaced by nor gates, this results in an xnor gate, which can be converted to an xor gate by inverting the output or one of the inputs (e.g. with a fifth nor gate). an alternative arrangement is of five nor gates in a topology that emphasizes the construction of the function from formula_12 formula_15 (noting from de morgan's law that a nor gate is, in effect, an inverted-input and gate). two possible configurations constructed from nand gates and two possible configurations constructed from nor gates are shown below.
xor gate
a nand gate is a universal gate, meaning that any other gate can be represented as a combination of nand gates.









































section::::making other gates by using nand gates.:not.









































a not gate is made by joining the inputs of a nand gate together. since a nand gate is equivalent to an and gate followed by a not gate, joining the inputs of a nand gate leaves only the not gate.









































section::::making other gates by using nand gates.:and.









































an and gate is made by inverting the output of a nand gate as shown below.









































section::::making other gates by using nand gates.:or.
nand logic