Truth Tables
 

Truth tables are used to help show the function of a logic gate. If you are unsure about truth tables and need guidence on how go about drawning them for individual gates or logic circuits then use the truth table section link.

 

Example Truth Table

 





















Input A Input B Output Q
0 0 0
0 1 0
1 0 0
1 1 1

 

more ...

 


Truth tables























Input A Input B Output Q
0 0 0
0 1 0
1 0 0
1 1 1

 

A truth table is a good way to show the function of a logic gate. It shows the output states for every possible combination of input states. The symbols 0 (false) and 1 (true) are usually used in truth tables. The example truth table on the right shows the inputs and output of an AND gate.

There are summary truth tables below showing the output states for all types of 2-input and 3-input gates. These can be helpful if you are trying to select a suitable gate.




Logic ICs

4001 and other quad 2-input gates Logic gates are available on special ICs (chips) which usually contain several gates of the same type, for example the 4001 IC contains four 2-input NOR gates. There are several families of logic ICs and they can be split into two groups:

  • 4000 Series
  • 74 Series
To quickly compare the different families please see:

  • Summary table of logic families

The 4000 and 74HC families are the best for battery powered projects because they will work with a good range of supply voltages and they use very little power. However, if you are using them to design circuits and investigate logic gates please remember that all unused inputs MUST be connected to the power supply (either +Vs or 0V), this applies even if that part of the IC is not being used in the circuit!



NOT gate (inverter)

The output Q is true when the input A is NOT true, the output is the inverse of the input: Q = NOT A
A NOT gate can only have one input. A NOT gate is also called an inverter.









traditional NOT gate symbol IEC NOT gate symbol










Input A Output Q
0 1
1 0
Traditional symbol IEC symbol Truth Table




AND gate

The output Q is true if input A AND input B are both true: Q = A AND B
An AND gate can have two or more inputs, its output is true if all inputs are true.









traditional AND gate symbol IEC AND gate symbol





















Input A Input B Output Q
0 0 0
0 1 0
1 0 0
1 1 1
Traditional symbol IEC symbol Truth Table




NAND gate (NAND = Not AND)

This is an AND gate with the output inverted, as shown by the 'o' on the output.
The output is true if input A AND input B are NOT both true: Q = NOT (A AND B)
A NAND gate can have two or more inputs, its output is true if NOT all inputs are true.









traditional NAND gate symbol IEC NAND gate symbol





















Input A Input B Output Q
0 0 1
0 1 1
1 0 1
1 1 0
Traditional symbol IEC symbol Truth Table




OR gate

The output Q is true if input A OR input B is true (or both of them are true): Q = A OR B
An OR gate can have two or more inputs, its output is true if at least one input is true.









traditional OR gate symbol IEC OR gate symbol





















Input A Input B Output Q
0 0 0
0 1 1
1 0 1
1 1 1
Traditional symbol IEC symbol Truth Table




NOR gate (NOR = Not OR)

This is an OR gate with the output inverted, as shown by the 'o' on the output.
The output Q is true if NOT inputs A OR B are true: Q = NOT (A OR B)
A NOR gate can have two or more inputs, its output is true if no inputs are true.









traditional NOR gate symbol IEC NOR gate symbol





















Input A Input B Output Q
0 0 1
0 1 0
1 0 0
1 1 0
Traditional symbol IEC symbol Truth Table




EX-OR (EXclusive-OR) gate

The output Q is true if either input A is true OR input B is true, but not when both of them are true: Q = (A AND NOT B) OR (B AND NOT A)
This is like an OR gate but excluding both inputs being true.
The output is true if inputs A and B are DIFFERENT.
EX-OR gates can only have 2 inputs.









traditional EX-OR gate symbol IEC EX-OR gate symbol





















Input A Input B Output Q
0 0 0
0 1 1
1 0 1
1 1 0
Traditional symbol IEC symbol Truth Table




EX-NOR (EXclusive-NOR) gate

This is an EX-OR gate with the output inverted, as shown by the 'o' on the output.
The output Q is true if inputs A and B are the SAME (both true or both false): Q = (A AND B) OR (NOT A AND NOT B)
EX-NOR gates can only have 2 inputs.









traditional EX-NOR gate symbol IEC EX-NOR gate symbol





















Input A Input B Output Q
0 0 1
0 1 0
1 0 0
1 1 1
Traditional symbol IEC symbol Truth Table





Summary truth tables

The summary truth tables below show the output states for all types of 2-input and 3-input gates.




























































Summary for all 2-input gates
Inputs Output of each gate
A B AND NAND OR NOR EX-OR EX-NOR
0 0 0 1 0 1 0 1
0 1 0 1 1 0 1 0
1 0 0 1 1 0 1 0
1 1 1 0 1 0 0 1















































































Summary for all 3-input gates
Inputs Output of each gate
A B C AND NAND OR NOR
0 0 0 0 1 0 1
0 0 1 0 1 1 0
0 1 0 0 1 1 0
0 1 1 0 1 1 0
1 0 0 0 1 1 0
1 0 1 0 1 1 0
1 1 0 0 1 1 0
1 1 1 1 0 1 0
Note that EX-OR and EX-NOR
gates can only have 2 inputs.




Combinations of logic gates

Logic gates can be combined to produce more complex functions. They can also be combined to substitute one type of gate for another.























Input A Input B Output Q
0 0 0
0 1 0
1 0 1
1 1 0
For example to produce an output Q which is true only when input A is true and input B is false, as shown in the truth table on the right, we can combine a NOT gate and an AND gate like this:

A AND NOT B

Q = A AND NOT B


Working out the function of a combination of gates

Truth tables can be used to work out the function of a combination of gates.





































































Inputs Outputs
A B C D E Q
0 0 0 1 0 1
0 0 1 1 0 1
0 1 0 0 0 0
0 1 1 0 1 1
1 0 0 0 0 0
1 0 1 0 0 0
1 1 0 0 0 0
1 1 1 0 1 1
For example the truth table on the right show the intermediate outputs D and E as well as the final output Q for the system shown below.

Combination of NOR, AND and OR gates

D = NOT (A OR B)
E = B AND C
Q = D OR E = (NOT (A OR B)) OR (B AND C)




Substituting one type of gate for another

Logic gates are available on ICs which usually contain several gates of the same type, for example four 2-input NAND gates or three 3-input NAND gates. This can be wasteful if only a few gates are required unless they are all the same type. To avoid using too many ICs you can reduce the number of gate inputs or substitute one type of gate for another.

3-input AND gate operating as a 2-input AND gate

Reducing the number of inputs

The number of inputs to a gate can be reduced by connecting two (or more) inputs together. The diagram shows a 3-input AND gate operating as a 2-input AND gate.

making a NOT gate from a NAND gate

Making a NOT gate from a NAND or NOR gate

Reducing a NAND or NOR gate to just one input creates a NOT gate. The diagram shows this for a 2-input NAND gate.


Any gate can be built from NAND or NOR gates

As well as making a NOT gate, NAND or NOR gates can be combined to create any type of gate! This enables a circuit to be built from just one type of gate, either NAND or NOR. For example an AND gate is a NAND gate then a NOT gate (to undo the inverting function). Note that AND and OR gates cannot be used to create other gates because they lack the inverting (NOT) function.

To change the type of gate, such as changing OR to AND, you must do three things:


  • Invert (NOT) each input.
  • Change the gate type (OR to AND, or AND to OR)
  • Invert (NOT) the output.
For example an OR gate can be built from NOTed inputs fed into a NAND (AND + NOT) gate.



NAND gate equivalents

The table below shows the NAND gate equivalents of NOT, AND, OR and NOR gates:























Gate Equivalent in NAND gates
NOT NOT gate NOT gate made from a NAND gate
AND AND gate AND gate made from NAND gates
OR OR gate OR gate made from NAND gates
NOR NOR gate NOR gate made from NAND gates



Substituting gates in an example logic system

Combination of NOR, AND and OR gates The original system has 3 different gates: NOR, AND and OR. This requires three ICs (one for each type of gate).

To re-design this system using NAND gates only begin by replacing each gate with its NAND gate equivalent, as shown in the diagram below.




Equivalent NAND gate system


Simplified NAND gate system Then simplify the system by deleting adjacent pairs of NOT gates (marked X above). This can be done because the second NOT gate cancels the action of the first.

The final system is shown on the right. It has five NAND gates and requires two ICs (with four gates on each IC). This is better than the original system which required three ICs (one for each type of gate).

Substituting NAND (or NOR) gates does not always increase the number of gates, but when it does (as in this example) the increase is usually only one or two gates. The real benefit is reducing the number of ICs required by using just one type of gate.


(c) Shilpa Sayura Foundation 2006-2017