0% found this document useful (0 votes)
16 views22 pages

Lecture-3 DE

This document summarizes a lecture on digital electronics and Boolean algebra. It discusses Boolean logic laws like absorption and De Morgan's laws. It also covers gate minimization techniques like consensus theorem and how to write Boolean functions as sums of minterms or products of maxterms. Examples are provided to demonstrate minterm and maxterm expansions from truth tables.

Uploaded by

Md Adil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views22 pages

Lecture-3 DE

This document summarizes a lecture on digital electronics and Boolean algebra. It discusses Boolean logic laws like absorption and De Morgan's laws. It also covers gate minimization techniques like consensus theorem and how to write Boolean functions as sums of minterms or products of maxterms. Examples are provided to demonstrate minterm and maxterm expansions from truth tables.

Uploaded by

Md Adil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

Lecture-3

Digital Electronics
(ITIT1201)

Dr. Nalin Kumar Sharma


Deptt. of Electronics and Electrical Engineering
Objectives of this Lecture
• Boolean Algebra
• Gate minimization

Dr. Nalin Kumar Sharma 2


Absorption law
• This law involved absorbing similar variables, i.e., 

1. A.(A+B) = A 
2. A + AB = A
3. A+ A'B = A+B
4. A(A' + B) = AB

Dr. Nalin Kumar Sharma 3


De Morgan law
The operation of an AND or OR logic circuit is unchanged if all inputs
are inverted, the operator is changed from AND to OR, and the output
is inverted, i.e., 

1. (A.B)' = A' + B’ 


2. (A+B)' = A'.B'

Dr. Nalin Kumar Sharma 4


Consensus theorem (Redundancy theorem): 
• AB + A'C + BC = AB + A’C

• Conditions for applying Redundancy theorem are:


1. Three variables must present in the expression. Here A, B and C are
used as variables.
2. Each variables is repeated twice.
3. One variable must present in complemented form.

Keep the terms with complimented variable


Dr. Nalin Kumar Sharma 5
Consensus theorem (Redundancy theorem): 
• (A+B).(A'+C).(B+C)=
= (A+B).(A’+C)

Dr. Nalin Kumar Sharma 6


Minimization of Boolean function
• Number of logic gates decreases
• Speed of operation increases
• Power dissipation decreases
• Cost decreases
• Complexity decreases

Dr. Nalin Kumar Sharma 7


Example: Minimize the Boolean function
• F= ABC’D’ + ABC’D + AB’C’D + ABCD + AB’CD + ABCD’ + AB’CD’

Dr. Nalin Kumar Sharma 8


Minterms
• The product of all variable, either with complement or without
complement, is known as minterm.

• Ex: ABC, A’B’C

• Using variable values, we can write the minterms as:


If the variable value is 1, we will take the variable without its
complement.
If the variable value is 0, take its complement.

Dr. Nalin Kumar Sharma 9


Minterms

Dr. Nalin Kumar Sharma 10


Maxterm Expansion
• The sum of all variable, either with complement or without
complement, is known as maxterm.
• Ex: A+B+C; A’+B+C’
• Using the given variable values, we can write the maxterm as:
If the variable value is 0, then we will take the variable without a
complement.
If the variable value is 1, take the complement of the variable.
• Let's assume that we have three Boolean variables A, B., and C having
values: A=1,B=0;C=0;
• Maxterm=A’+B+C
Dr. Nalin Kumar Sharma 11
Maxterm

Dr. Nalin Kumar Sharma 12


Minterm Expansion (Standard Sum of
Product)
• When a function is written as sum (ORing) of minterms.

• Other name: Canonical SOP

• If F=1 for i-th row of the truth table, the term will present in the
minterm expansion.

Dr. Nalin Kumar Sharma 13


Minterm Expansion (Standard Sum of Product)
Minterm Expansion of a general function of 3 variables can be written as

Sum sign denotes logical summation

The variables can be 0 or 1

Dr. Nalin Kumar Sharma 14


SOP Example:1
Determine the minterm expression/expansion from the following truth table
A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0

Dr. Nalin Kumar Sharma 15


SOP Example-2
• Determine minterm expansion of

F=A’BC’+AB’C+A’B’C+A’B’C’

• Converting Sum of Products (SOP) to shorthand notation


• Converting shorthand notation to SOP expression

Dr. Nalin Kumar Sharma 16


Maxterm Expansion (Standard Product of
Sum)
• When a function is written as Product (ANDing) of maxterms.

• Other name: Canonical POS

• If F=0 for i-th row of the truth table, the term will present in the
maxterm expansion.

Dr. Nalin Kumar Sharma 17


Maxterm Expansion (Standard Product of Sum)
Minterm Expansion of a general function of 3 variables can be written as

sign denotes logical product

The variables can be 0 or 1

Dr. Nalin Kumar Sharma 18


POS Example:1
Determine the minterm expression/expansion from the following truth table
A B C F
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0

Dr. Nalin Kumar Sharma 19


POS Example-2
• Determine minterm expansion of

F=(A’+B+C’).(A+B’+C).(A’+B’+C)

Dr. Nalin Kumar Sharma 20


Point to ponder
• What is relation between SOP and POS?

Dr. Nalin Kumar Sharma 21


References
• https://www.javatpoint.com/minterm-and-maxterm-in-digital-
electronics

Dr. Nalin Kumar Sharma 22

You might also like