Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
0 votes

A ⊕ B   can be represented using 4 NAND gates as well as 5 NAND gates.

Is there any predefined procedure to find the minimum number of NAND gate required by an expression?

in Digital Logic 29 points 16 views

1 Answer

0 votes
I think, There is no any such procedure. But we can use the results like AND-OR operation (like AB+CD)can be replace by NAND-NAND.

Anyway questions will always ask minimum number of NAND as we can easily increase the NAND gate. For example 'A' can be represent using 2 NAND gate as well as 4, 6,8 or more NAND gate.
23 points