LOGIC GATES AND

BOOLEAN ALGEBRA

CHAPTER 2 (CONT…..)

1
Logic Gates
Name Graphical Algebraic Truth Table
Symbol Function

x y f
AND x f = x.y
f 0 0 0
y
0 1 0
1 0 0
1 1 1

OR f=x+y x y f
x 0 0 0
y f
0 1 1
1 0 1
1 1 1

INVERTER x f f = x’ x f
0 1
1 0

2
Logic Gates
Name Graphical Algebraic Truth Table
Symbol Function
y
NAND f = (x.y)’ x f
x 0 0 1
y f 0 1 1
1 0 1
1 1 0
x y f
NOR f = (x + y)’
x 0 0 1
y f 0 1 0
1 0 0
1 1 0
y
EX-OR f = x’y + xy’ x f
x 0 0 0
y f 0 1 1
1 0 1
1 1 0
x y f
EX-NOR x
f = x’y’ + xy
0 0 1
y f 0 1 0
1 0 0
1 1 1
3
Boolean Expression
 Boolean expressions are a much better form for representing digital
circuits because it is much easier to manipulate and simplify.
 A Boolean expression is an expression formed with:
 binary variables
 the binary operators OR and AND
 the operator NOT
 parentheses
 an equal sign
 For example,
 F = x y + z F is 1 when z = 1 OR when x = 0 AND y = 1.
 The precedence of operations is as follows:
 parentheses,
 NOT,
 AND
 OR.

4
 Boolean Algebra
 Definition: Theorems that are used at design time
to manipulate and simplify Boolean expressions
for easier and less expensive implementation.
 Any Boolean expression can be represented using
only AND, OR, and NOT operations.
 May need to use Boolean algebra to change the
form of a Boolean expression to better utilize the
types of gates provided by the component library
being used.
 A Boolean variable, x, can have two values,
typically 1 and 0 (on and off)

5
Laws and Rules Boolean Algebra

Boolean Addition: Boolean Multiplication:

* A+0 = A * A·0 = 0
* A+1 = 1 * A·1 = A
* A+A = A * A·A = A
* A+Ā = 1 * A·Ā = 0
Complement Rules: Boolean other Rules:
= * A+AB = A
* A=A * A+ĀB = A+B
Ā+AB = Ā+B
Commutative Laws: Associative Laws:
A+B = B+A A+(B+C) = (A+B)+C
A·B = B·A A(BC) = (AB)C

Distributive Laws: Demorgan’s Theorem:

A(B+C) = AB+AC XY = X + Y
* (A+B)(A+C) = A+BC
X +Y = XY
6
Boolean Analysis of Logic Circuits
 The Boolean Expression for a Logic Circuit
 Any logic circuit, may completely described using the
Boolean expressions.
 To derive the Boolean Expression of a given logic circuit,
begin the left-most inputs and work toward the final output,
writing the expression for each gate.
 Ex:
A AB
B AB+CD

C
D CD

7
Boolean Analysis of Logic Circuits
 Ex: A

B
Y
C

A
 Ex:
B
W

8
Boolean Analysis of Logic Circuits
 Constructing Truth Table for a logic circuit
 Once the Boolean expression has been determined,
truth table can be developed.
 Boolean expression have to evaluate for all possible
combinations of values input variable.
 If there are four input variables (A, B, C, D) therefore
sixteen (24=16) combinations of values possible.
 Evaluating the Expression:
 To evaluate the expression, first find the values of the
variables that make the expression equal to 1, using
rules for Boolean addition and multiplication.

9
Boolean Analysis of Logic Circuits
 Putting the Results in Truth Table Format.
 The first step, list the sixteen input variable
combinations of 1s and 0s in binary sequence.
 Place a 1 in the output column for each
combination of input variables.
 Place a 0 in the output column for all other
combinations input variables.

10
DeMorgan’s Theorem
 Apply DeMorgan’s theorem to the expression:

WXYZ

W+ X+Y+ Z

( A + B + C) D


AB + CD + EF


11
 Simplification Using Boolean
Algebra
 Ex: Simplify the Boolean expression

Y = AB + A( B + C ) + B( B + C )



( )(
F = ( X +Y ) X +Y X + Z )
 [ AB( C + BD ) + AB]C

ABC + ABC + ABC + ABC + ABC

AB + AC + ABC

F = XY + X Z + YZ
12
Standard Forms of Boolean
Expressions
 All Boolean expressions, regardless of their
form can be converted into either of two
standard forms:
 sum-of-product forms
 product-of-sums forms

 Standardization makes the evaluation,

simplification and implementation of Boolean
expressions much more systematic and
easier.

13
Standard Forms of Boolean Expressions
 Sum-of-products (SOP) form:
 Two or more product terms are summed by Boolean
addition.
 OR the outputs of two or more AND gates.
 Eg: ABC + AB + ABCD
 A single over bar cannot extend over more than one
variable, eg: ABC
 Standard SOP-all the variables in the domain apear in
each product term, eg: A BCD + A BC D + A BC D

14
Sum-of-products (SOP)
 Converting product terms to standard SOP
 Step 1: multiply each nonstandard product term by a
term made up of the sum of a missing variable and its
complement.
 Repeat step 1 until all resulting product terms contain
all variables.
 Ex: Convert following Boolean expression into
standard SOP form: ABC + AB + ABC D

15
Standard Forms of Boolean Expressions
 Product-of-Sums (POS) form:
 Two or more um terms are multiplied by Boolean
multiplication.
 AND the outputs of two or more OR gates.
 ( )( )(
Eg: A + B + C B + C + D A + B + C + D )
 A single over bar cannot extend over more than one
variable, eg: A + B + C
 Standard POS- all the variables in the domain appear in
( )( )( )
each product term, eg: A + B + C + D A + B + C + D A + B + C + D

16
Product-of-Sums (POS)
 Converting a sum term to Standard POS
 Add to each nonstandard product term a term made up
of the product of the missing variable and its
complement.
 Repat step 1 untill all esuling sum terms contain all
variables.
 Ex: Convert the following Boolean expression into

( )( )( )
standard POS form: A + B + C B + C + D A + B + C + D

17
Standard Forms of Boolean Expressions
 Converting Standard SOP to Standard POS
 Step1: Determine the binary numbers for each literal.
 Step2: Determine the absent binary numbers.
 Step3: Write the binary numbers from Step 2 in equivalent
term in opposite standard

 Ex: Convert the following SOP expression to an equivalent POS

expression

A BC + ABC + ABC + A BC + ABC

18
Converting Standard SOP & Standard POS to
Truth Table Format
 SOP- equal to 1 only if at least one of the
product terms is equal to 1.
 POS-equal to 0 only if at least one of the sum
terms is equal to 0.

19
 Converting Standard SOP to Truth Table
Format
A B C Y
0 0 0 0
0 0 1 1
0 1 0 0
A BC
0 1 1 1
1 0 0 0
ABC
1 0 1 1
1 1 0 0 A BC
1 1 1 0

A
B  Ex: Develop the
C
truth table for the
A
B
expression Y = ABC + ABC
C
Y
and draw the logic
A circuit.
B
C

20
 Converting Standard POS to Truth Table
Format

A B C Y
0 0 0 1
0 0 1 1
0 1 0 0 A+ B+ C
0 1 1 1
1 0 0 0 A+ B+ C
1 0 1 1
1 1 0 1
1 1 1 0 A+ B+ C
B
C  Ex: Develop the truth
table for ( A + B ) • ( A + B ) • ( A + B )
Y
and draw logic circuit.

21
The Karnaugh Map (K-map)
 Is an array of cells in which each cell
represents a binary value of the input
variables.
 Can be used for expressing two, three, four,
and five variables.
 Mapping a nonstandard SOP expression:
 A Boolean expression must first be in standard
form before putting in Karnaugh map.

22
The K-Map SOP Minimization
 Grouping/looping the 1s
 Each cell in a group must be adjacent, this included
wrap-around adjacent.
 Maximize the size of the groups, but minimize the
number of groups.
 A group must contain either 1,2,4,16 cells (power of 2).
 Overlapping groups is allowed.
 Determine the minimum SOP expression
 Each group of cells containing 1s creates one product
terms composed of all variables that occur either
uncomplemented or complemented.
 Variables with both uncompleted and complemented
within the group are eliminated.

23
2 variables K-map
 A two variable K-map with their truth table
which is showing product terms of each line
as shown below
B B
A B Product term
Ā
0 0 AB AB AB
0 1 AB
1 0 A AB AB
1 1 AB
AB
 Ex: Map the following SOP expression of two
variables. AB + AB + AB
24
2 variables K-map

25
3 Variable K-map
A B C Product C C
terms
0 0 0 A BC AB A BC ABC
0 0 1
ABC
0 1 0 ABC ABC
0 1 1 ABC AB
1 0 0 ABC
AB A BC A BC
1 0 1 A BC
1 1 0 A BC
1 1 1 ABC AB ABC ABC
ABC

 Ex: Map the SOP expression ABC + ABC + ABC + ABC + ABC
of three variables.

26
3 Variable K-map

27
4 Variable K-map

28
 4 Variable K-map
 Ex: Map the following four variable SOP
expressions:
ABC D + A BC D + A BC D + ABC D + ABC D + A BC D + ABCD + A BCD + ABCD

29
More examples

30
More examples

31
More examples

32
More examples

33
More examples

34
More examples
 Use a K-map to simplify the following Boolean function:

F(A,B,C) = Σm(0,2,3,7)

BC
00 01 11 10
A A’B

00
0 0 1 3 2

A’C’ 1 1 1

01
1 4 5 7 6

BC

35
More examples
 Use a K-map to simplify the following Boolean function:
F(A,B,C,D) = ΠM(0,1,2,4,9,11,15)
F(A,B,C,D) = Σm(3,5,6,7,8,10,12,13,14)
CD CD CD
00 01 11 10 00 01 11 10 00 01 11 10
AB AB AB

00 0 1 3 2 00 0 1 3 2
00 0 1 3 2

1 1 1
01 4 5 7 6 01 4 5 7 6
01 4 5 7 6

1 1 1 1 1 1 1 1 1
11 12 13 15 14 11 12 13 15 14
11 12 13 15 14

1 1 1 1 1 1 1 1 1
10 8 9 11 10 10 8 9 11 10
10 8 9 11 10

1 1 1 1 1 1

Prime Implicants Essential Prime Final Expression

Implicants

F(A,B,C,D) = BC'D + AD' + A'CD + BCD'

36
“Don’t Care” On Karnaugh Map
 “Don’t Care” conditions
 Eg: in BCD code which have 6 invalid
combination: 1010, 1011, 1100, 1101, 1110,
and 1111.
 A “X” is placed in the cell.
 It can be treat as either 1 or 0.
 When grouping, the Xs, it can be treated as 1s
to make a larger grouping.

37
The K-Map POS Minimization
 Determine the minimum SOP expression
 Determine the binary value of each sum term
in the standard POS expression.
 As each sum term is evaluated, place a 0 on
the Karnaugh map in the corresponding cell.

38
 The K-Map POS Minimization
 Ex: Map the following standard POS expression on a
K-map.

1) ( A + B + C ) ( A + B + C )( A + B + C )( A + B + C )( A + B + C )
2) ( A + B + C + D) ( A + B + C + D)( A + B + C + D) ( A + B + C + D)( A + B + C + D)

39