Outline

Boolean Algebra and Switching Circuits

Laws and Rules of Boolean Algebra
De Morgans Laws
Chapter 11: Boolean Algebra
Karnaugh Maps
and Logic Circuits Logic Circuits
Universal Logic Gates
jenwei@mail.ntust.edu.tw

2008 Spring

1 2

Boolean Algebra and Switching Boolean Algebra and Switching

Circuits (1/2) Circuits (2/2)
A two-state device is one whose basic elements The and-function: A B
can only have one of two conditions. Defined as both A and B
In Boolean algebra, if A represents one state, The equivalent electrical circuit is two switches
then A, called not-A, represents the second connected in series. A B Z=AB
0 0
state. A 1 B 1
0 0 0
0 1 0
The or-function: A + B 1 0 0
Defined as A, or B, or both A and B 1 1 1

The equivalent electrical circuit is two switches The not-function: A

connected in parallel. A B Z=A+B Defined as the opposite to A A Z=A
0
A 1 0 0 0 Truth Table 0 1
0 0 1 1 1 0
B 1 1 0 1
1 1 1 3 4
 Problems Problems
Problem 1. Derive the Boolean expression and Problem 4. Derive the Boolean expression and
construct a truth table for the switching circuit construct the switching circuit for the truth table
shown below. given below. A B C Z
1 0 0 0 1
2 0 0 1 0

[Z = A (B A + B) B] 3 0 1 0 1
4 0 1 1 1
5 1 0 0 0
A B BA B BA+B A Z=A(BA+B)B
6 1 0 1 1
0 0 0 1 1 1 1
7 1 1 0 0
0 1 0 0 0 1 0 8 1 1 1 0
1 0 0 1 1 0 0
1 1 1 0 1 0 0 5
[Z = A B C + A B C + A B C + A B C] 6

Exercise 46 Exercise 46
Exercise 4. Determine the Boolean expressions Exercise 10. Derive the Boolean expression
and construct truth table for the switching circuit. and construct the switching circuit for the truth
A B C Z table stated.
1 0 0 0 0 A B C Z
2 0 0 1 0 1 0 0 0 1
3 0 1 0 0 2 0 0 1 0
4 0 1 1 1 3 0 1 0 1
5 1 0 0 0 4 0 1 1 0
6 1 0 1 0 5 1 0 0 1
7 1 1 0 0 6 1 0 1 1
8 1 1 1 1 [Z = A B C + A B C + 7 1 1 0 0

[Z = C (B C A + A (B + C))] A B C + A B C] 8 1 1 1 0

7 8
 Simplifying Boolean Expressions Laws and Rules of Boolean Algebra (1/2)
If the Boolean expression can be simplified, then Commutative Laws A+B=B+A
the number of switches or logic elements can be AB=BA
reduced resulting in a saving in cost. Associative Laws (A + B) + C = A + (B + C)
Three principal ways of simplifying Boolean (A B) C = A (B C)
expression are:
Distributive Laws A (B + C) = A B + A C
By using the laws and rules of Boolean algebra
A + (B C) = (A + B) (A + C)
By applying de Morgans laws
By using Karnaugh maps Sum Rules A+0=A
A+1=1
A+A=A
A+A=1
9 10

Laws and Rules of Boolean Algebra (2/2) Problems

Product Rules A0=0 Problem 5. Simplify the Boolean expression:
A1=A PQ+PQ+PQ
AA=A [P + Q]
AA=0
Problem 6. Simplify (P + P Q) (Q + Q P)
Absorption Rules A+AB=A [P + Q]
A (A + B) = A
A+AB=A+B Problem 7. Simplify
FGH+FGH+FGH
[G (F + H)]

11 12
 Problems Exercise 47
Problem 8. Simplify Use the laws and rules of Boolean algebra to
FGH+FGH+FGH+FGH simplify the following expressions:
[H] Exercise 6. F G H + F G H + F G H
[H (F + G)]
Problem 9. Simplify
A C + A (B + C) + A B (C + B)
Exercise 12.
[A C + B + A C]
R (P Q + P Q + P Q) + P (Q R + Q R)
Problem 10. Simplify [P + Q R]
P Q R + P Q (P + R) + Q R (Q + P)
[P R]
13 14

De Morgans Laws & Problems Problems & Exercise 48

De Morgans laws may be used to simplify not-
functions having two or more elements.
The laws state that:
A + B = A B and A B = A + B
Problem 11. Verify that A + B = A B
Problem 12. Simplify the Boolean expression
( A B ) + ( A + B ) by using de Morgans laws and
the rules of Boolean algebra.
[A + B]
15
Problem 13. Simplify the Boolean expression
( A B + C ) ( A + B C ) by using de Morgans laws
and the rules of Boolean algebra.
[A C]
Use de Morgans law and the rules of Boolean
algebra to simplify the following expressions.
Exercise 2. ( A + B C ) + ( A B + C )
[A + B + C]
Exercise 3. ( A B + B C ) A B
[A B + A B C]
16
 Two-Variable Karnaugh Maps Three-Variable Karnaugh Maps
A truth table for the three-variable expression:
Z = A B C + A B C + A B C

Each of the four possible

Boolean expression associated
with a two-variable function

A truth table for a two- A

B 0 1
variable expression Two-variable
0 0 1
Karnaugh map
1 0 0
17 18

Four-Variable Karnaugh Maps Simplifying a Boolean Expression

Using a Karnaugh Map (1/2)
Z = A B C D + A B C D
a) Draw a 4, 8, or 16-cell matrix, depending on
+ A B C D + A B C D whether there are 2, 3, or 4 variables.
b) Mark in the Boolean expression by putting 1s
in the appropriate cells.
c) From couples of 8, 4, or 2 cells having common
edges, forming the largest groups of cells
possible.
Note that a cell containing a 1 may be used more
than once when forming a couple.
Also note that each cell containing a 1 must be used
at least once.
19 20
 Simplifying a Boolean Expression Problems
Using a Karnaugh Map (2/2)
Problem 14. Use the Karnaugh map techniques
d) The Boolean expression for the couple is given to simplify the expression P Q + P Q
by the variables which are common to all cells
[P]
in the couple.
Problem 15. Simplify the expression
X Y Z + X Y Z + X Y Z + X Y Z
by using Karnaugh map techniques.
[Y Z + Y Z]
Problem 17. Simplify ( P + Q R) + ( P Q + R)
using a Karnaugh map technique.
[P + Q R]
21 22

Problems Exercise 49
Problem 19. Simplify the expression A B C D + Use Karnaugh map techniques to simplify the
A B C D + A B C D + A B C D + A B C D expression given.
by using Karnaugh map techniques. Exercise 3. ( P Q) ( P Q)
[B D + A B C D] [P Q]

Exercise 4. A C + A ( B + C ) + A B (C + B)
[A C + B + A C]

Exercise 8. A B C D + A B C D + A B C D
[B C (A + D)]

23 24
 Exercise 49 Logic Circuits (1/3)
Use Karnaugh map techniques to simplify the The and-gate: The or-gate:
expression given. A A A A
B & Z B Z B 1 Z B Z
Exercise 10. A B C D + A B C D + A B C D C C
AMERICAN
C C
AMERICAN

+ A B C D + A B C D
BRITISH BRITISH

INPUTS OUTPUT INPUTS OUTPUT

[A D + A B C D] A B C Z=ABC A B C Z=A+B+C
0 0 0 0 0 0 0 0
Exercise 11. A B C D + A B C D + A B C D 0 0 1 0 0 0 1 1
0 1 0 0 0 1 0 1
+ A B C D + A B C D + A B C D + A B C D 0 1 1 0 0 1 1 1

[A C + A C D + B C D] 1 0 0 0 1 0 0 1
1 0 1 0 1 0 1 1
1 1 0 0 1 1 0 1
25 1 1 1 1 1 1 1 1 26

Logic Circuits (2/3) Logic Circuits (3/3)

The invert-gate or not-gate: The nand-gate: The nor-gate:
A A A
A Z A Z B
C
& Z A
B
C
Z B
C
1 Z B
C
Z

BRITISH AMERICAN AMERICAN AMERICAN

BRITISH BRITISH

INPUTS OUTPUT INPUTS OUTPUT INPUTS OUTPUT

ABC A+B+C
A Z=A A B C Z=ABC A B C Z=A+B+C
0 1 0 0 0 0 1 0 0 0 0 1
1 0 0 0 1 0 1 0 0 1 1 0
0 1 0 0 1 0 1 0 1 0
0 1 1 0 1 0 1 1 1 0
1 0 0 0 1 1 0 0 1 0
1 0 1 0 1 1 0 1 1 0
1 1 0 0 1 1 1 0 1 0
1 1 1 1 0 27 1 1 1 1 0 28
Combinational Logic Networks (1/2) Combinational Logic Networks (2/2)
Problem 22. Device a logic circuit to meet the Problem 23. Simplify the expression:
requirements of the output given below using as Z = P Q R S + P Q R S + P Q R S + P Q R S
few gates as possible.
Inputs Output + P Q R S
[Z = A (B + C)] A B C Z
and devise a logic circuit to give this output.
0 0 0 0
0 0 1 0 [Z = R (P + Q S)]
0 1 0 0
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1
29 30

Exercise 50 Exercise 50
Exercise 2. Devise a logic system to meet the Simplify the Boolean expressions given and devise
requirement of the Boolean expression: a logic circuit to give the requirement of the
Z = A B + B C simplified expression.
Exercise 5. Simplify the expression given in the Exercise 9. P Q R + P Q R + P Q R
truth table and devise a logic circuit to meet the [R (P + Q)]
requirements stated. A B C Z

[Z = A B + C] 0 0 0 0 Exercise 11. A B C D + A B C D + A B C D
0 0 1 1
0 1 0 0 + A B C D + A B C D
0
1
1
0
1
0
1
0
[D (A C + B)]
1 0 1 1
1 1 0 1
1 1 1 1 31 32
 Exercise 50
Exercise 12. ( P Q R) ( P + Q R) The function of any of the five logic gates in
[P (Q + R)]
33
Problems
Problem 26. Design a logic circuit, using nand-
gates having not more than three inputs, to meet
the requirements of the Boolean expression
Z = A+ B +C + D
[hint: It is usual in logic circuit design to
start the design at the output.]
Problem 27. Use nor-gates only to design a
logic circuit to meet the requirements of the
expression: Z = D ( A + B + C )
35
Universal Logic Gates & Problem
common use can be obtained by using either
nand-gates or nor-gates.
When used in this manner, the gate selected is
called a universal gate.
Problem 24. Show how invert, and, or, and
nor-functions can be produced using nand-gates
only.
Problem 25. Show how invert, or, and, and
nand-functions can be produced by using nor-
gates only.
34
Problems
Problem 28. An alarm indicator in a grinding mill
complex should be activated if (a) the power
supply to all mills is off and (b) the hopper
feeding the mills is less than 10% full, and (c) if
one of the three grinding mills is not in action.
Device a logic system to meet these
requirements.
[A: the power supply on to all the mills
B: the hopper feeding the mills being more than 10% full
C, D, and E: the three mills being in action respectively]
36
 Exercise 51
Exercise 1. Use nand-gates only to devise the
logic system: Z = A + B C
In Problem 4 to 6, use nor-gates only to devise the
logic systems stated.
Exercise 4. Z = ( A + B ) (C + D)
Exercise 5. Z = A B + B C + C D
Exercise 51
Exercise 9. A water tank feeds three separate
processes. When any two of the processes are
in operation at the same time, a signal is
required to start a pump to maintain the head of
water in the tank. Devise a logic circuit using
nor-gates only to give the required signal.
[Z = A (B + C) + B C
or Z = A B + A C + B C]

Exercise 6. Z = P Q + P (Q + R )

37 38

Homework Midterm
Assignment 3 Announcement
Deadline: 21 April 2008
(Firm Real-Time) 21 April 2008

39 40