Professional Documents
Culture Documents
1. AND-OR logic:
▪ It produces Sum-of-Products (SOP) expression
▪ It can have any number of AND gates each with any number
of inputs
Product terms
A
AB
B
C CD
D AB + CD + . . . + JK
Sum-of-products
J
JK
K
Product term
continued…
A
B ABC
C X = ABC + DE SOP
D
DE
E
continued…
D X = (ABC)(DE) DeMorgan
E DE X = (A + B + C)(D + E) POS
continued…
3. Exclusive-OR logic:
✓ The truth table for an exclusive-OR Inputs Output
gate is A B X
✓ Notice that the output is HIGH 0 0 0
0 1 1
whenever A and B disagree. 1 0 1
1 1 0
▪ The Boolean expression is X = AB + AB
C C
1. Group the 1’s into two overlapping
AB 1
B changes groups as indicated.
across this AB 1 1 2. Read each group by eliminating any
boundary variable that changes across a boundary.
AB 3. The vertical group is read A C.
C changes 4. The horizontal group is read AB.
AB
across this
boundary The circuit is on the next slide:
continued…
Circuit: A
C X= AC + AB
A
B
A
C X= AC + AB
A
B
From a truth table to a logic circuit
▪ By writing the SOP or POS expression from the truth table
we can implement the logic expression.
Develop a logic circuit with four input variables that will only
produce a 1 output when exactly three input variables are 1’s
A A A AB
B
Inverter AND gate
A A
A+B A+B
B B
b) NOR gates:
✓ Are also universal gates and can form all of the basic
gates.
A A A A+ B
B
Inverter OR gate
A A
AB AB
B B
A
C X= AC + AB
A
B
A
B X = (A + B)(A + C)
A
C
A
A
G1
B B
G3
C
C
G2
D D
G1
G2
G3
continued…
Cout Symbol
2. Full-Adder
▪ Notice that the result from the previous example can be read
directly on the truth table for a full adder.
Inputs Outputs
A B Cin Cout S
S S 0 Sum
0 0 0 0 0 1 A S 1 A S
0 0 1 0 1
0 1 0 0 1 1
0 1 1 1 0 0 B Cout 0 B Cout
1 0 0 0 1
1 0 1 1 0 1 Cout
1 1 0 1 0
1 1 1 1 1 1
Parallel Adders
▪ Full adders are combined into parallel adders that can add
binary numbers with multiple bits. A 4-bit adder is shown.
A4 B4 A3 B3 A2 B2 A1 B1
C0
C4
C3 C2 C1
S4 S3 S2 S1
▪ The logic symbol for a 4-bit parallel adder is shown. This 4-bit
adder includes a carry in (labeled (C0) and a Carry out (labeled
C4).
S
1 1
Binary 2 2 4-bit
number A 3 3 sum
4 4
1
Binary 2
number B 3
4
Input Output
C0 C4
carry carry
A0 A0
A1 X A1 X
A2 A2
A3 A3
Active HIGH decoder for 0011 Active LOW decoder for 0011
4. Decoders
A0 = 0
A1 = 1
1
A2 = 0
A3 = 1
4. Decoders
1 0 1
A0
2 0
1
3 1
A1
4 0
5 0 0
6
0
0 A2
7
8 0 0
A3
0
9
5. Encoders
VCC
R7 R8 R9
Keyboard
7 8 9
encoder HPRI/BCD
1
R4 R5 R6 2
3 1
4 2
5 4 BCD complement of
6
4 5 6 7
8 key press
8
9
R1 R2 R3 74HC147
1 2 3
R0
The zero line is not needed by the
0 encoder, but may be used by other
circuits to detect a key press.
6. Code converters
▪ There are various code converters that change one code to another.
▪ Two examples are the four bit binary-to-Gray converter and the
Gray-to-binary converter.
1 1 1 1
0 0
0 MSB 0 MSB
Binary-to-Gray Gray-to-Binary
7. Multiplexers
MUX
0
S0 0
Data 1 1
select S1
▪ Two select lines are shown here Data
D0 0
to choose any of the four data D1 1 output
Data
inputs. D
inputs D2 2
3 3
The serial data input waveform and data select inputs are shown
below. Determine the data output waveforms on for the above demultiplex