BOOLEAN ALGEBRA
INTRODUCTION
Let B be a set, + and × two binary operations, a unary operation, 0 and 1 two distinct
elements of B. The sextruplet {B, +, ×, ,0,1} is called a Boolean algebra if the following hold:
• Commutativity: a+b =b+a a×b =b×a
• Distributivity: a + (b × c) = (a + b) × (a + c) a × (b + c) = (a × b) + (a × c)
• Identity: a=
+0 a =
a ×1 a
• Complement: a=
+a 1 a=
×a 0
Without parentheses, has precedence over × and × has precedence over + .
DUALITY
To obtain the duality of a statement in Boolean algebra, interchange × and + , and
0 and 1 in the original statement.
For example: the dual of a × 0 = b is a + 1 =b.
COMMON TERMS
Expression: Any variable or combination of variables built up from the variables
using × , + , or .
Literal: Any variable or complement of a variable.
Fundamental product: A literal or a product of two or more literals in which no two literals
involve the same variable. Eg: x ; xy z ; x y are all fundamental
products. However xxy ; xyzx are not. Any Boolean product is
reducible to 0 or a fundamental product.
SUM-OF-PRODUCTS
A Boolean expression is in a sum-of-products form (also called minterm form) if the expression
is a fundamental product or the sum of two or more fundamental products none of which is
included in another fundamental product.
Example: xz + yz + xy z can be written in the sum-of-products form as xz + yz . Note that
xz + xy z =
xz by absorption law.
LOGIC GATES AND TRUTH TABLES
The OR gate:
A B X=A+B
1 1 1
1 0 1
0 1 1
0 0 0
The AND gate:
A B X=AB
1 1 1
1 0 0
0 1 0
0 0 0
The NOT gate
A X=A
1 0
0 1
The XOR (exclusive-OR ) gate acts in the same way as the logical "either/or." The output is "true"
if either, but not both, of the inputs are "true." The output is "false" if both inputs are "false" or
if both inputs are "true." Another way of looking at this circuit is to observe that the output is 1
if the inputs are different, but 0 if the inputs are the same.
XOR gate
Input 1 Input 2 Output
0 0 0
0 1 1
1 0 1
1 1 0
The NOR gate
Input A Input B Output
0 0 1
0 1 0
1 0 0
1 1 0
The NAND gate
Input A Input B Output
0 0 1
0 1 1
1 0 1
1 1 0
The XNOR (exclusive-NOR) gate is a combination of XOR gate followed by an inverter. Its output
is "true" if the inputs are the same, and "false" if the inputs are different.
XNOR gate
Input 1 Input 2 Output
0 0 1
0 1 0
1 0 0
1 1 1
Using combinations of logic gates, complex operations can be performed. In theory, there is no
limit to the number of gates that can be arrayed together in a single device. But in practice,
there is a limit to the number of gates that can be packed into a given physical space. Arrays of
logic gates are found in digital integrated circuits (ICs). As IC technology advances, the required
physical volume for each individual logic gate decreases and digital devices of the same or
smaller size become capable of performing ever-more-complicated operations at ever-
increasing speed.
Boolean Algebra & Logic Circuits Class Tutorials
Consider the Boolean expression E ( x, y, z ) = x y + xy z + xy .
1. Draw the logic circuit for the expression.
2. Simplify the expression into S.O.P form.
3. Draw the logic circuit for the S.O.P form.
4. Draw the truth table for each of the two logic circuits.
5. CASE:
The given Boolean expression represents a security lock system which opens ONLY
when E ( x, y, z ) = 1 . It is unsafe to have too many combinations that can open the system.
Management has requested that only one combination should open the system.
5.1 With a stroke of a pen, change the Boolean expression to meet Management’s request.
5.2 Change any one gate in each of your logic circuits to meet Management’s request.
Complete S-O-P form
A Boolean expression is in a complete sum-of-products form if the expression is in sum-of-
products form and each term contains all the variables in the expression.
Examples:
1. E ( x , y , z=
) x y + z is not in a complete S-O-P. (Why?)
2. E ( x , y ,=
z ) x yz + x yz is not in a complete S-O-P form. (Why?)
3. E ( x , y , z ) = x yz + xyz + x yz is in a complete S-O-P form.
ADDERS
Half Adder
Full Adder
CLASS EXERCISES
1. The expression E ( x , y , z ) = xy + x yz + x + y is given
1.1 Simplify the given expression
1.2 Draw the logic circuit of E ( x , y , z ) = xy + x yz + x + y as it is
1.3 Draw the logic circuit of the simplified form
1.4 Draw the truth table for both expressions
2. Write the expression B( x , y ,=
z ) xy z + y z in a complete sum-of-products form.
