Boolean Algebra Lecture 04

Prime University
2A/1, Darus Salam Road, Mirpur-1, Dhaka-1216, Bangladesh Faculty of Engineering Department of Electrical and Electronic Engineering Course Conducted by: Shuvodip Das Digital Electronics EEE 357 Lecture 04

Boolean Algebra (Continued)

Laws of Boolean Algebra: T1: Commutative Law (a) A + B = B + A (b) A B = B A T2: Associate Law (a) (A + B) + C = A + (B + C) (b) (A B) C = A (B C) T3: Distributive Law (a) A (B + C) = A B + A C (b) A + (B C) = (A + B) (A + C) T4: Identity Law (a) A + A = A (b) A A = A T5: (a) (b) T6: Redundancy Law (a) A + A B = A (b) A (A + B) = A T7: (a) 0 + A = A (b) 0 A = 0 T8: (a) 1 + A = 1 (b) 1 A = A T9: (a) (b) T10: (a) T11: a) A = A T12: De Morgan's Theorem (a) (b) (b)

Boolean Algebra Lecture 04

Demorgans Theorems: Demorgan, a great mathematician, contributed two theorems of Boolean Algebra which are extremely useful in simplifying expressions in which a product or sum of variables is inverted. Demorgans Theorems are: 1. This theorem can be stated as the complement of a product of variables is equal to the sum of the complement of the variables. This theorem can be stated in another way: NOT (A AND B) = (NOT A) OR (NOT B) The complement of two or more variables ANDed is equivalent to the OR of the complements of the individual variables. 2. This can be stated as the complement of a sum of variables is equal to the product of the complements of the variables. This can be stated in another way The complement of two or more variables ORed is equivalent to the AND of the complements of the individual variables.

Simplification process in Demorgans theorem: Step 1: Remove the overall NOT Sign. Step 2: Change all the ANDs to ORs and all the ORs to ANDs. Step 3: Then complement or negate all individual variables.

Boolean Algebra Lecture 04

Simplification by Demorgans Theorem or Demorganize: Problem 01: Simplify Solution:

As a result, the original circuit is reduced to a three-input AND gate with the A input inverted:

Problem 02: Simplify AB  CD

 BC and draw the simplified Logic Circuit.

Boolean Algebra Lecture 04

Problem Solution:

03:

Simplify and draw the simplified logic circuit.

Simplified logic Circuit

Sum of Product (SOP) and Product of Sum (POS):

A liter l is a variable or t e compleme t of a variable. The domai of a ge eral Boolean Expression is the set of variables contained in the expression in either complemented or un-complemented form. For example: the domain of the expression A B  ABC is the set of variables A,B,C and the domain of the expression A C  CD  CD E is the set of variable A,B,C ,D and E. All Boolean expressions, regardless of their form, can be converted into either of t o standard forms: i. ii. Sum of Product (SOP) and Product of Sum (POS) form.

SOP Form: A product term is defined as a term consisting of the product (Boolean multiplication) of literals. When t o or more products are summed by Boolean addition, the resulting expression is um of Product ( OP). Some examples are: i. ii. iii. AB+ACD A C  C D  CD E
A B  ABC

In OP expression, a single overbar cant be extended over more than one variable although more than one variable in a term can have an overhead. ( OP expression can have the term A C but not A C ) Product of Sum (POS): A um term is defined as the term consisting of the um (Boolean addition) of literals. When t o or more um terms are multiplied, the resulting expression is a Product of ums (PO ). Examples: ( A  B) ( A  B  C ) A PO expression can contain a single variable term as in A ( A 
 C ) (  C  D)

In a PO expression, a single overbar cant extend over more than one variable, although more than one variable in a term can have an overbar. A PO expression can have the term A  B  C but not A  B  C Karnaugh Map (K-Map): Karnaugh maps provide an alternative way of simplifying logic circuits. Instead of using Boolean algebra simplification techniques, you can transfer logic values from a Boolean statement or a truth table into a Karnaugh map. The arrangement of 0's and 1's within the map helps us to visualize the logic relationships between the variables and leads directly to a simplified Boolean statement.
5

Alge

Lec

e 04

Boolean Algebra Lecture 04

Karnaugh maps, or K-maps, are often used to simplify logic problems with 2, 3 or 4 variables. A Karnaugh Map is similar to a Truth Table as it represents all of the possible values if input variables and the resulting output for each value. The Karnaugh Map is an array if cells in which each cell represents a binary value of the input variables. The cells are arranged insuch a way that simplification of a given expression is simply a matter of properly grouping the cells. Karnaugh maps can be used for expression with two, three, four and five variables. Why do we use K-Map (Karnaugh Map)? To simplify Boolean expressions When we have simplified the expressions, we can minimi e the logic gates used There are two expressions concerned here, SOP and POS 2 Variable Karnaugh Map:

3 Variable Karnaugh Map:

4 Variable Karnaugh Map:

Problem 01: Map the standard SOP expression

BC 

Solution: For each standard product term a 1 is placed on the 3-variable karnaugh map.
BC 

BC

100

011

BC on a Karnaugh map.

Problem 02: Map the following standard SOP expression into a karnaugh map:
A CA C A C A C

Solution:
A CA C A C A C

001 + 010 + 110

+ 111

Problem 03: Map the following standard SOP expression a karnaugh map:
A B CD  A BC D  ABC D  ABCD  ABC D  A B C D  AB CD (H.W)

Cell Adjacency: The cells in a K-map are arranged so that there is only a single variable change between adjacent cells. Adjacency is defined by a single-variable change. Cells that differ by only one variable are adjacent. Looping groups of two (Pair):



 

le

Alge

Lec

"!

e 04

# $

# $

# $

# $

Looping a pair of adjacent 1s in a K-map eliminates the variables that appear in complemented and uncomplemented form. Looping groups of four (Quards): Looping a quad of adjacent 1s eliminates the two variables that appear in both complemented and uncomplemeted form.

2-variable Karnaugh maps:

&)(

'& %%

le

Alge

Lec

)1 0

e 04

The Karnaugh map for the OR gate is completed by entering a '1' in each of the appropriate cells. The horizontal group could have been written as: After grouping, this reduces to: B In a similar way, the vertical group could have been written as: The vertical group reduces to: A In this way, the Karnaugh map leads to the overall expression A + B. Problem 01: Simplify the following expression using a Karnaugh map:

Solution: The Boolean statement is:

The truth table is: input C 0 0 0 0 1 1 1 1 input B 0 0 1 1 0 0 1 1 input A 0 1 0 1 0 1 0 1 output 0 1 1 0 0 1 1 0

The Karnaugh map is:

365

43 22

le

Alge

Lec

68 7

e 04

This is the exclusive OR function. The value of C is irrelevant. Problem 02: Simplify the following expression using a Karnaugh map:

Solution:

= The Boolean statement is:

The truth table is: input C 0 0 0 0 1 1 1 1 input B 0 0 1 1 0 0 1 1 input A 0 1 0 1 0 1 0 1 output 1 0 1 0 1 0 0 0

The Karnaugh map is:

The vertical column gives the term

as you would expect.

10

@CB

A@ 99

le

Alge

Lec

CE D

e 04

This map illustrates an important feature of Karnaugh maps. This is that the edges of the map 'wrap around' to the opposite edge. In other words, the cells and form a group. Within the group,
.

is constant, while B can be 0 or 1. Therefore B can be eliminated leaving

11

GPI

HG FF

le

Alge

Lec

PR Q

e 04