Professional Documents
Culture Documents
Republic of Cameroon
Peace Work Fatherland
We are familiar with the arithmetic operators add (+), subtract (-), multiply (x) and divide (/)
which operate n numbers. Apart from these arithmetic operators, we can define logical
operators which operate on what we called truth values. A truth value can be TRUE or
FALSE and the common operators are: AND, OR, NOT. These logical operators are also
called Boolean operators, from the English mathematician George Boole, who developed the
theory of mathematic logic in the 19th century. This chapter aims to present the concept of
Boolean algebra and its applications on logic circuits
Learning objectives
After studying this lesson, student should be able to:
Use AND, OR and NOT operators and apply them on lo.gic gates
Understand the laws and the principles of Boolean algebra.
Gibe the logic function of a logic circuit and vice-versa
Understand and use the rules of Boolean algebra to simplify functions and to
minimize logic circuits
Contents
I.
II.
III.
IV.
EXERCISES................................................................................................................................................ 7
This topic and others are available on www.dzplacide.overblog.com and www.placide.blog4ever.com in PDF format
I.
By DZEUGANG Placide
LOGIC GATES
The term gate is used to describe the set of the basic electronic components, which when
combined with each other are able to perform complex logical and arithmetic operations. As
discussed earlier, everything in the digital world is based on the binary number system.
Numerically, this involves only two symbols: 0 and 1. According to the need, we can use
these symbols or we can equate them with others. Thus, when dealing with digital logic, we
can specify that: 0 = False = No. 1 = True = Yes
B
0
1
0
1
X=A.B
0
0
0
1
B
0
1
0
1
X=A+B
0
1
1
1
By DZEUGANG Placide
opposite logic level. In terms of bits, it changes '1' to '0' and vice versa. The standard logic
symbol for the NOT gate and the truth table illustrating the relationship between the variables
and the logic gate operation are shown below respectively.
A
0
1
=
1
0
x = A or where the prime () represents the NOT operation. This expression is read as:x
equals NOT A. x equals the inverse of A. x equals the complement of A.
II.
BOOLEAN ALGEBRA
These rules can be checked by the use of truth table. Some of these rules can be derived from
simpler identities derived in this package.
This topic and others are available on www.dzplacide.overblog.com and www.placide.blog4ever.com in PDF format
By DZEUGANG Placide
III.
Addition
Multiplication
A+B=B+A
AB = BA
A + (B + C) = (A + B) + C
A (BC) = (AB) C
A (B + C) = AB + AC
A + (BC) = (A + B) (A + C)
+ = .
= +
A Logic circuit to a number of gates joined together to produce a specific output from given
inputs. For example, lets consider the following circuit: It contains three inputs A, B and C
A Boolean function is an expression formed with binary variables and logical operators (OR,
AND, NOT and equal sign). In essence, a truth table is a list, which defines a Boolean
function. For example, X = A B + A C. Let us consider the truth table of the given value as
shown
A
0
0
0
0
1
1
1
1
Inputs
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
A.B
0
0
0
0
0
0
1
1
A.C
0
0
0
0
0
1
0
1
Output
X = AB + AC
0
0
0
0
0
1
1
1
According to the truth table above we realize that = + + . This is called the
disjunctive normal form of the function f; the combinations formed by considering the rows
with an output value of 1 are joined by the disjunctive connective, OR.
We can then prove that the expressions + + and AB + AC are equivalent
This topic and others are available on www.dzplacide.overblog.com and www.placide.blog4ever.com in PDF format
By DZEUGANG Placide
= + +
= ( + + )
= [ + ( + )]
= ( + )
= ( + )
= +
IV.
Using combinations of logic gates, complex operations can be performed. Although there is
no limit to the number of gates that can be arrayed together in a single device, nevertheless,
in practice, there is a limit to the number of gates that can be packed into a given physical
space. Some basic combination gates are: NAND gate, NOR gate, Exclusive-OR (XOR) and
Exclusive-NOR (XNOR) gate
B
0
1
0
1
= (NAND)
1
1
1
0
B
0
1
0
1
= (NOR)
1
0
0
0
This topic and others are available on www.dzplacide.overblog.com and www.placide.blog4ever.com in PDF format
By DZEUGANG Placide
A
B
= (XOR)
= (XNOR)
0
0
0
1
0
1
1
0
1
0
1
0
1
1
0
1
The exclusive-OR gate and exclusive-NOR gate are denoted by the and , respectively.
In addition, these gates perform the following Boolean functions:
= +
= +
(b) = + =
c) + = + = + + ( )
d) + = + = + + + = + = ( )
This topic and others are available on www.dzplacide.overblog.com and www.placide.blog4ever.com in PDF format
By DZEUGANG Placide
EXERCISES
Exercise 1 MCQ
1. Select the Boolean expression that is not equivalent to x x + x x
(b) (x + x) x (c)
(a) x (x + x)
(d) x
(b) x z
(c) y z
(d) x y z
(b)
(c) x
(d)
(b) 0 + x y + y
(c) x y
(d) y
Exercise 2 :
Use logic gates to represent these expressions and draw up the corresponding truth tables.
1. x(+x)
2. a+(c)
3. b(a+(b+c))
4. +
5. +
6. ( + )
Exercise 3:
Write down the Boolean expression for each of the circuits below.
This topic and others are available on www.dzplacide.overblog.com and www.placide.blog4ever.com in PDF format
By DZEUGANG Placide
Exercise 4:
Show if these combinatorial circuits are equivalent by working out the Boolean expression
and the truth table for each circuit.
Exercise 5
Draw the truth table for the Boolean function defined as (, , ) = ( + )
Exercise 6
For the given truth table, form a Boolean function
A
0
0
0
0
1
1
1
1
B
0
0
1
1
0
0
1
1
C
0
1
0
1
0
1
0
1
f(A,B,C)
1
1
0
0
1
0
1
1
Exercise 7:
A burglar alarm for a house is controlled by a switch. When the switch is on, the alarm
sounds if either the front or back doors or both doors are opened. The alarm will not work if
the switch is off. Design a circuit of logic gates for the alarm and draw up the corresponding
truth table.
This topic and others are available on www.dzplacide.overblog.com and www.placide.blog4ever.com in PDF format
By DZEUGANG Placide
Exercise 8
Find the disjunctive normal form of the Boolean function for these truth tables:
Exercise 9
Design circuits for each of the following using only NAND gates and then NOR gates.
1) AB
2) A
3) +
4) +B
Exercise 10
Simplify the following expressions and check your answer by drawing up truth tables.
(a) +
(b) + +
(c) + ( + )( + )
Exercise 11
(a) Establish a truth table for the Boolean function , , = + ( + )
(b) Design a circuit using as few AND, OR and NOT gates as possible to model the
function in (a).
This topic and others are available on www.dzplacide.overblog.com and www.placide.blog4ever.com in PDF format