To produce a 3-input OR gate when only 2-input OR gates are available: Use 3 OR gates Inputs to Gate A are input 1 and input 2 Input to Gate B is input 3 (if 2 inputs are necessary, include input 3 and FALSE) Inputs to Gate C are outputs from Gate 1 and Gate 2 === If input 1 OR 2 is TRUE, output of Gate A will be TRUE. If input 3 is TRUE, output of Gate B will be TRUE. If output of Gate A OR Gate B is TRUE, output from Gate C will be TRUE. That is if one ore more of Inputs 1, 2 or 3 is TRUE, the result will be TRUE. Otherwise, output of Gate C will be FALSE.
you can take 2 input or gate first 2inputs and output of that gate should be given as the input for next OR gate with 3rd input
Above solution will not work if all 3 inputs are True. I believe the question requires a configuration of XOR gates that will produce a True result if EXACTLY one out of three inputs is True.
Specifically, if Inputs A and B are both True, the first XOR Gate output will be False. If Input C is also True, the second XOR Gate output will be True, yielding an overall TRUE result. This is not the desired result.
I don't know the correct answer, but I'm pretty sure the first answer is not complete.
Truth table for 3 input XOR gate
INPUTS OUTPUTS
ABC X
000 0
001 1
010 1
011 0
100 1
101 0
110 0
111 1
From the table we can use 2 XOR gates to get 3 inputs XOR with the same result.
1st XOR Gate
AB X
00 0
00 0
01 1
01 1
10 1
10 1
11 0
11 0
2nd XOR Gate
XC Y
00 0
01 1
10 1
11 0
10 1
11 0
00 0
01 1
I was also confuse for when 3 inputs are 111, but I'm now sure from few references saying that 111 input will produce an output of 1.
You can construct a NAND gate using relays. If the contacts are in series, it is an AND gate. If the contacts are in parallel, it is an OR gate. Depending on which contact you use, it is a NOT gate. Simply pick the right combination of contacts and the meaning of the signal, and you can consider it to be a NAND gate.
universal logic gate is a gate using which you can make all the logic gates there are two such gates NOR gate and NAND gate
A universal gate is a gate which can implement any Boolean function without need touse any other gate type.The NAND and NOR gates are universal gates.In practice, this is advantageous since NAND and NOR gates are economical andeasier to fabricate and are the basic gates used in all IC digital logic families.In fact, an AND gate is typically implemented as a NAND gate followed by aninverter not the other way around!!Likewise, an OR gate is typically implemented as a NOR gate followed by an inverternot the other way around!!A universal gate is a gate which can implement any Boolean function without need touse any other gate type.The NAND and NOR gates are universal gates.In practice, this is advantageous since NAND and NOR gates are economical andeasier to fabricate and are the basic gates used in all IC digital logic families.In fact, an AND gate is typically implemented as a NAND gate followed by aninverter not the other way around!!Likewise, an OR gate is typically implemented as a NOR gate followed by an inverternot the other way around!!can be combined to produce AND, OR,NOT,XORand XNOR gates
Next: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates ContentsUsing NAND gatesNOTFigure 12.10: Realizing a NOT gate using a NAND gateOR The following statements are called DeMorgan's Theorems and can be easily verified and extended for more than two variables.(12.1)(12.2)(12.3)(12.4)In general: (12.5)Thus :(12.6)Now it is easy to see that , which can be checked from the truth table easily. The resulting realization of OR gate is shown in 12.11Figure 12.11: Realization of OR gate by NAND gatesAND gateFigure 12.12: Realization of AND gate by NAND gatesX-OR gate(12.7)Clearly, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates.Figure 12.13: X-OR gateX-NOR gate(12.8)Again, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates, i.e., NAND or NOR gates.Figure 12.14: X-NOR gateNext: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates Contentsynsingh 2007-07-25
A&B = ((A&B)')' So two, it would go a - | ==NAND--=NAND-- b - | By using two NAND gates back-to-back, you can create a normal AND gate.
You can construct a NAND gate using relays. If the contacts are in series, it is an AND gate. If the contacts are in parallel, it is an OR gate. Depending on which contact you use, it is a NOT gate. Simply pick the right combination of contacts and the meaning of the signal, and you can consider it to be a NAND gate.
There is no such thing as an R-S NAND gate.The datasheet for a 7474 IC will give you a schematic for a D flipflop using NAND gates only.
NAND gates are universal gates and can be used to construct any of the logic gates (AND, OR, NOT, NOR, XOR, XNOR). The easiest way to figure this out is to use basic Boolean Laws. For instance, to create a NOT gate (A'), tie one of the NAND gate's input to logic high: (A+1)' = A'. To create an AND gate (AxB), use two NANDs in series, with the second one configured as an inverter: (AxB) = ((AxB)')'
universal logic gate is a gate using which you can make all the logic gates there are two such gates NOR gate and NAND gate
That title of "Universal Gate" is reserved for NAND gates because you can build all possible logic using only NAND logic . You can build even other basic logic like AND, OR and NOT using NAND.
universal gates are the ones from which we can design other gates also. for eg. NAND and NOR gates. they help in forming the uniformity in the circuits.
two nand gates
By using 5 NOR gates, we can implements half-subtractor. The inputs for 1st NOR gate are A and B, for 2nd NOR gate inputs are the output of 1st NOR gate and A input, for 3rd NOR gate inputs are the output of 1st NOR gate and B input, for 4th NOR gate the inputs are gates 2 and 3, and for last gate input is the output of the 4th gate.
A universal gate is a gate which can implement any Boolean function without need touse any other gate type.The NAND and NOR gates are universal gates.In practice, this is advantageous since NAND and NOR gates are economical andeasier to fabricate and are the basic gates used in all IC digital logic families.In fact, an AND gate is typically implemented as a NAND gate followed by aninverter not the other way around!!Likewise, an OR gate is typically implemented as a NOR gate followed by an inverternot the other way around!!A universal gate is a gate which can implement any Boolean function without need touse any other gate type.The NAND and NOR gates are universal gates.In practice, this is advantageous since NAND and NOR gates are economical andeasier to fabricate and are the basic gates used in all IC digital logic families.In fact, an AND gate is typically implemented as a NAND gate followed by aninverter not the other way around!!Likewise, an OR gate is typically implemented as a NOR gate followed by an inverternot the other way around!!can be combined to produce AND, OR,NOT,XORand XNOR gates
Next: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates ContentsUsing NAND gatesNOTFigure 12.10: Realizing a NOT gate using a NAND gateOR The following statements are called DeMorgan's Theorems and can be easily verified and extended for more than two variables.(12.1)(12.2)(12.3)(12.4)In general: (12.5)Thus :(12.6)Now it is easy to see that , which can be checked from the truth table easily. The resulting realization of OR gate is shown in 12.11Figure 12.11: Realization of OR gate by NAND gatesAND gateFigure 12.12: Realization of AND gate by NAND gatesX-OR gate(12.7)Clearly, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates.Figure 12.13: X-OR gateX-NOR gate(12.8)Again, this can be implemented using AND, NOT and OR gates, and hence can be implemented using universal gates, i.e., NAND or NOR gates.Figure 12.14: X-NOR gateNext: Boolean Expressions Up: Universality of certain gates Previous: Universality of certain gates Contentsynsingh 2007-07-25
an AND gate and a NOT gate
A&B = ((A&B)')' So two, it would go a - | ==NAND--=NAND-- b - | By using two NAND gates back-to-back, you can create a normal AND gate.