Gates Circuits 2015
Gates Circuits 2015
Gate
A device that performs a basic
operation on electrical signals.
Circuits
Gates combined to perform more
complicated tasks.
Statements:
A = My grandmother is alive
B = My grandfather is alive
Half adder
A circuit that computes the sum of two bits
and produces the correct carry bit
sum = A B
carry = AB
Figure 4.10 A full adder
Digital circuits can be used to store
information
1
0
1
1
0
1
0
1
1
01
1
0
1
0
1
1
0
1
0
1
0
1
1
01
0
1
01
0
1
0
1
1
01
0
1
01
0
1
0
1
It is straightforward to obtain a truth table
from a circuit or Boolean Expression.
It is also straightforward to obtain a circuit
from a Boolean expression or conversely.
It is not so obvious how to construct a
Boolean expression (or circuit) from a
complicated truth table.
This can be done using DNF.
1. Move down the truth table selecting all the
rows where the output value is True (1);
2. Select a row;
3. Use the appropriate inputs or their
negations to form the corresponding
conjunction (this means that for each input
A, say, use A if its value in the row is 1 or
use A’ if its value in the row is 0, and
combine them using AND);
4. Combine the conjuctions using OR.
A B C X
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1 x A’BC
1 0 0 0
1 0 1 0
x ABC’
1 1 0 1
1 1 1 1 x ABC
A’BC+ABC’+ABC
Notice that the three chosen rows give 1 in the expression by construction.