Scribd
Upload
9 views

Lecture4 Part2 With Voice

Uploaded by

dhruveshbhure9999
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views

Lecture4 Part2 With Voice

Uploaded by

dhruveshbhure9999
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Combinational Logic Circuits

or Combinational Circuits

The digital circuits made up of combination of


logic gates discussed earlier can be
classified as combinational logic circuits
because at any time, the logic level at the
output depends on the combination of logic
levels present at the inputs.

A combinational circuit has no memory, so its


output depends only on the current value of
its inputs.
Standard Forms For Logical Expression

For the purposes simplification and design of


the logic circuits, we try to express their logical
expressions in one of two standard forms:

Sum-of-Products (SOP) Form


or
Product-of-Sums (POS) Form
Sum-of-Products (SOP) Form

Examples: (i) ABC+ABC (ii) AB+ABC+CD+D

Note that each expression consists of two or more AND


terms (products) that are ORed (summed) together such
that:

(i) The same variable never appears twice in a product.


(Because and )

(ii) One complement sign can not cover more than one
variable in a term (e.g., we can not have as we can
then use De Morgan’s law to simplify
Example-1

Express the following Boolean function as sum of


products

Solution:
f ( A , B , C , D)=( A+BC)(B +CD)
¿ A B+ A CD+B BC+BC CD
¿ A B+ A CD+B C +BC D
Example-2

Express the following Boolean function as sum of


products

Solution:
f ( A , ⋯ , E)=( A+BC)( D+BE)
¿ ( A+ B+ C) [ D ( B+ E) ]
¿ ( A+ B+ C)(B D+ D E)
¿ A B D+B B D+C B D+ A D E+B D E+C D E
¿ A B D+ A D E +B C D+B D+B D E +C D E
Canonical SOP Form

A SOP form in which each product term involves all


the variables (complemented or uncomplemented)
is referred to canonical SOP form

In canonical SOP form, each individual product


term is referred to as a minterm

Example:
Canonical SOP form

On simplifying we have,
As 2nd prod no longer has all literals, canonical form is lost
Product of Sums (POS) Form

In this form a Boolean function consists of two or


more OR terms (sums) that are ANDed together.
Each OR term contains two or more variables in
complemented or uncomplemented form such that:
(i) The same variable used never appears twice in
a sum. (Because and )

(ii) One complement sign can not cover more than


one variable in a term

E.g.
Canonical POS Form

When a Boolean function is expressed as a


POS, where each term consists of a sum, the
sum involving all of the variables in either
complemented or uncomplemented form

In canonical POS form, each individual sum term


is referred to as a maxterm

E.g.
Minterms and Maxterms of 3 Variables

Minterms Maxterms
A B C Representing Designation Representing Designation
term term
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Example
Express the following Boolean function in the canonical
SOP Form
f ( A , B , C)= A +B C
Solution: In each product term, insert the missing variables
using identity and complement laws
f ( A , B , C)= A +B C
¿ A ( B+ B )( C +C ) + ( A+ A ) B C
¿ ( AB+ A B ) ( C+C ) + A B C + A B C
¿ ABC+ AB C+ A B C + A B C+ A B C + A B C
¿ ABC+ AB C+ A B C + A B C+ A B C
¿ 𝑚7 + 𝑚6 +𝑚5 +𝑚 4 +𝑚 1=Σ 𝑚(1 , 4 ,5 ,6 ,7)
Example
Express the following Boolean function in the canonical
POS Form
f ( A , B , C)=( A +B)(B +C)(C + A)
Solution: In each product term, insert the missing variables
using identity and complement laws
f ( A , B , C)=( A +B)(B +C)(C + A)
¿ ( A+B+C C)(B+C+ A A )(C +A +B B)
¿ ( A + B+C )( A + B+C ) ( A + B+C ) …
( A + B+C)( A + B+C )( A+ B+ C)
¿ ( A + B+C )( A + B+C ) ( A+ B +C)( A + B+C)
¿ M 0 ∙ M 1 ∙ M 2 ∙ M 4 =Π M (0 ,1 , 2 , 4)
Simplifying Logic Circuits

A
A A  BC X
B
A
C BC B

X  AB A  BC 

X = AB ( A+ BC )= AB ( Á ∙ BC ) = AB [ A ∙ ( B+C ) ] = AB ( B+C )= AB C

A
B X=ABC
C
C

You might also like