Scribd
Upload
21 views23 pages

Lec 17

The document discusses the concepts of Sum of Products (SOP) and Product of Sums (POS) in Boolean algebra, which are essential for logic design in electronic circuits. It explains how to represent logic systems and provides examples of standard forms, minterms, and the simplification of Boolean expressions. Additionally, it highlights the implementation of SOP expressions using AND/OR configurations.

Uploaded by

poluriharshavardhan210
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views23 pages

Lec 17

The document discusses the concepts of Sum of Products (SOP) and Product of Sums (POS) in Boolean algebra, which are essential for logic design in electronic circuits. It explains how to represent logic systems and provides examples of standard forms, minterms, and the simplification of Boolean expressions. Additionally, it highlights the implementation of SOP expressions using AND/OR configurations.

Uploaded by

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

BASIC ELECTRICAL AND ELECTRONICS

ENGINEERING
ECE-249

Dr. Sweta Chander


Sum of Product (SOP)
Laws of Boolean Algebra
Laws of Boolean Algebra
Laws of Boolean Algebra
Laws of Boolean Algebra
Example
• Draw the circuit diagram for
Example
• Draw the circuit diagram for
Example
• Draw the circuit diagram for
Implementation

Boolean Algebra applied in computers


electronic circuits. These circuits perform
Boolean operations and these are called logic
circuits or logic gates.
Logic Design
The logic gates which are combined for specific Boolean
function is called logic design.

Any logic system can be represented in two logically equivalent


ways:

• as the OR’ing of AND’ed terms, known as the Sum of Products


(SOP) form;

• as the AND’ing of OR’ed terms, known as the Product of Sums


(POS) form.

11
Logic Design

12
Standard Forms
• Standard Sum-of-Products (SOP) form: equations
are written as "AND" terms summed with "OR"
operators.
• Standard Product-of-Sums (POS) form: equations
are written as "OR" terms, all "ANDed" together.

• Examples:
SOP: A B C+AB C + B
POS: (A + B) • (A+B +C) • (C)

• These "Mixed" forms are not SOP or POS


Wrong: (A B + C) (A + C) or A BC +A C (A + B)
13
Sum of Product (SOP) form

14
Minterm
• A minterm is a special product of literals, in which each input
variable appears exactly once.
• A function with n variables has 2n minterms
• A three-variable function, such as f(A,B,C), has 22 = 4 minterms:

A literal is a variable or the complement of a variable

15
Minterm
A three-variable function, such as f(x,y,z), has 23 = 8 minterms:

16
Minterm

17
Sum of Product (SOP) form
• Every function can be written as a sum of products.
• If you have a truth table for a function, you can write a sum of
minterms expression just by picking out the rows of the table
where the function output is 1.

x y z f(x,y,z) f1(x,y,z) f = x’y’z’ + x’y’z + x’yz’ + x’yz + xyz’


= m 0 + m1 + m2 + m3 + m6
0 0 0 1 0
0 0 1 1 0 = (0,1,2,3,6)
0 1 0 1 0
0 1 1 1 0 f1 = xy’z’ + xy’z + xyz
1 0 0 0 1 = m4 + m5 + m 7
1 0 1 0 1 = (4,5,7)
1 1 0 1 0
1 1 1 0 1

18
Standard Sum-of-Products (SOP)

19
Standard Sum-of-Products (SOP)

20
Standard Sum-of-Products (SOP)
• Example: F( A, B, C) =  (1,4,5,6,7 )
• Simplifying
F= A B C + A BC +AB C + ABC +AB C
= A B (C+C) + AB C + ABC
+ AB C + AB C The Canonical Sum-
= A B + AB (C+C) + (A +A)B C of-Minterms form
= A B + AB + B C has (5 * 3) = 15
= A (B + B) +B C literals and 5 terms.
= A +B C The reduced SOP
form has 3 literals
and 2 terms.

21
AND/OR Two-level Implementation of
SOP Expression
• The two implementations for F are
shown below: (Which is simpler?)
A
B
C
A A
B F
C
A B
B F
C C
A
B
C
A
B
C 22
Standard SOP Form

23

You might also like