0 | 0 | 0 | 0 | |
0 | 0 | 1 | 0 | |
0 | 1 | 0 | 0 | |
0 | 1 | 1 | 1 | |
1 | 0 | 0 | 0 | |
1 | 0 | 1 | 1 | |
1 | 1 | 0 | 1 | |
1 | 1 | 1 | 0 |
What is the number of , and gates used to implement the described above?
Details and assumptions:
You cannot use gates other than mentioned ones.
You are free to use either the two-input or three-input or four-input logic gates or so whereas gate is always a uni-input gate.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Using Karnaugh map of the required function, we get: f ( x , y , z ) = x y z + x y z + x y z
To get a minimal solution, we need:
Three different NOT-gates to get x , y and z
Three different 3-input-AND-gates to get x y z , x y z and x y z
One 3-input-OR-gate to get the final expression f ( x , y , z ) = x y z + x y z + x y z .
Collectively, we need at-least 7 logic gates to design the function.
Note:
xyz is x AND y AND z, and x+y+z is x OR y OR z
Our aim was to minimize the number of gates, that is why we have chosen 3-input OR and AND gates. Otherwise we could, for example, get x y z by using two 2-input AND-gates such that x y z = ( x y ) z