0% found this document useful (0 votes)
1 views44 pages

DLD Week 3 Class 2 (4)

Uploaded by

amithahmed4
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)
1 views44 pages

DLD Week 3 Class 2 (4)

Uploaded by

amithahmed4
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/ 44

Week 3 Class 1

2/12/2023 Lec Md Shadman Aadeeb, Dept. of CSE 1


Logic Gates

2/12/2023 Lec Md Shadman Aadeeb, Dept. of CSE 2


Logic Gates

• Digital Circuit : A digital circuit is a circuit where the signal must be


one of two discrete levels.

• For example:
• 0 volt – ‘0’
• 5 volt – ‘1’

Lec Md Shadman Aadeeb, Dept. of CSE 3


2/12/2023
Logic Gates

• Logic Gates: Basic circuits/chips used to make the digital circuits.

• Logic gates are made using transistors

• We do not need to know about how transistors make up logic gates


for now.

Lec Md Shadman Aadeeb, Dept. of CSE 4


2/12/2023
Logic Gates

Three basic logic gates

AND OR
X Y Z = X+Y NOT
X Y Z = X·Y
0 0 0 0 0 0 X Z =X
0 1 0 0 1 1 0 1
1 0 0 1 0 1 1 0
1 1 1 1 1 1
Lec Md Shadman Aadeeb, Dept. of CSE 5
2/12/2023
Logic Gates
• Gate delay -length of time it takes for an input change to result in the
corresponding output change

Lec Md Shadman Aadeeb, Dept. of CSE 6


2/12/2023
Logic Gates

• Different kinds of logic gates

Lec Md Shadman Aadeeb, Dept. of CSE 7


2/12/2023
Logic Gates

• Different kinds of logic gates

Lec Md Shadman Aadeeb, Dept. of CSE 8


2/12/2023
Logic Gates

• Different kinds of logic gates

Lec Md Shadman Aadeeb, Dept. of CSE 9


2/12/2023
Boolean Algebra

2/12/2023 Lec Md Shadman Aadeeb, Dept. of CSE 10


Boolean Algebra

• The Boolean algebra is an algebra dealing with binary variables and


logic operations.

• It helps us mathematically represent digital circuits

Lec Md Shadman Aadeeb, Dept. of CSE 11


2/12/2023
Boolean Algebra

Boolean Function
A Boolean equation consisting of a binary variable identifying the
function followed by an equals sign and a Boolean expression.

In simpler terms:
It is a function which takes in some inputs and gives an output.
The inputs can take values of 0’s and 1’s.
The output will be either 0 or 1 depending on the inputs

Lec Md Shadman Aadeeb, Dept. of CSE 12


2/12/2023
Boolean Algebra

From a Boolean function we can get:

Lec Md Shadman Aadeeb, Dept. of CSE 13


2/12/2023
Boolean Algebra
Basic Identities: In mathematics, an identity is a statement true for all
possible values of its variable or variables.

Lec Md Shadman Aadeeb, Dept. of CSE 14


2/12/2023
Boolean Algebra
Basic Identities: In mathematics, an identity is a statement true for all
possible values of its variable or variables.

(1-4 Existence of 0 and 1)

(5-6 Idempotence)
(7-8 Existence of complement)
(9 Involution)

Lec Md Shadman Aadeeb, Dept. of CSE 15


2/12/2023
Boolean Algebra

Dual
• The dual of an algebraic
expression is obtained by
interchanging + and · and
interchanging 0’s and 1’s.

• Self dual:
• If the dual expression = the
original expression.

Lec Md Shadman Aadeeb, Dept. of CSE 16


2/12/2023
Boolean Algebra

Which of these functions are self dual?


• Example: F = (A + C) · B + 0
dual F = (A · C + B) · 1 = A · C + B
• Example: G = X · Y + (W + Z)
dual G = ((X+Y) · (W · Z)') = ((X+Y) ·(W' + Z')
• Example: H = A · B + A · C + B · C
dual H = (A + B)(A + C)(B + C)= = (A +BC) (B+C) = AB + AC + BC

Lec Md Shadman Aadeeb, Dept. of CSE 17


2/12/2023
Boolean Algebra

Which of these functions are self dual?


• Example: F = (A + C) · B + 0
dual F = (A · C + B) · 1 = A · C + B
• Example: G = X · Y + (W + Z)
dual G = (X+Y) · (W · Z) = (X+Y) ·(W + Z)
• Example: H = A · B + A · C + B · C
dual H = (A + B)(A + C)(B + C)= (A +BC) (B+C) = AB + AC + BC

Lec Md Shadman Aadeeb, Dept. of CSE 18


2/12/2023
Boolean Algebra

Algebraic Manipulation and Circuit Simplification

Lec Md Shadman Aadeeb, Dept. of CSE 19


2/12/2023
Boolean Algebra

Boolean Operator Precedence


• The order of evaluation in a Boolean expression:
• Parenthesis
• NOT
• AND
• OR
• Example:
• F = A(B + C)(C + D)
• With A=0, B=1, C=1, D=0

Lec Md Shadman Aadeeb, Dept. of CSE 20


2/12/2023
Boolean Algebra

Proofs
1. X + XY = X
2. XY + XY = X
3. X + XY = X+Y
4. X(X+Y)=X
5. (X+Y)(X+Y)= X
6. X (X+Y)=XY

Lec Md Shadman Aadeeb, Dept. of CSE 21


2/12/2023
Boolean Algebra

Proofs: Consensus Theorem


1

Lec Md Shadman Aadeeb, Dept. of CSE 22


2/12/2023
Boolean Algebra

• What did we understand by doing the proofs using Boolean Algebra?

⮚ Boolean Algebra based simplifications are difficult


⮚ No organized set of rules
⮚ Trial and error based process

❖We need a better method for simplification (coming soon)

Lec Md Shadman Aadeeb, Dept. of CSE 23


2/13/2023
Boolean Algebra

Finding the complement of a function:

Method 1: De Morgan’s :aw


Method 2: Dual+ Complement
each literal

Lec Md Shadman Aadeeb, Dept. of CSE 24


2/12/2023
Boolean Algebra

What does a function and the complement of a function mean?

Lec Md Shadman Aadeeb, Dept. of CSE 25


2/12/2023
Standard Form and Canonical
Form

2/12/2023 Lec Md Shadman Aadeeb, Dept. of CSE 26


Standard form and canonical form

• Canonical form : Each term of the Boolean expressions contain all


input variables either in true form or in complemented form.

• E.g. :
• F1(A,B,C) = A’B’C + ABC
• F2(A,B,C,D) = A’BCD + AB’C’D + ABCD
• F3(ABC) = (A+B+C’ ) . (A’+B+C) . (A’+B’+C’)

* Canonical sum of products and canonical product of sums


Lec Md Shadman Aadeeb, Dept. of CSE 27
2/12/2023
Standard form and canonical form

• Standard form : In this case, there should be at least one term that
does not contain all the variables

• E.g. :
• F1(A,B,C) = A’ + ABC
• F2(A,B,C,D) = A’BD + D + ABCD
• F3(ABC) = (A+B+C’ ) . (C) . (B’+C’)

* Standard sum of products and canonical product of sums


Lec Md Shadman Aadeeb, Dept. of CSE 28
2/12/2023
Standard form and canonical form

• What about these two cases?

• F1(A,B) = A+B - Standard sum of products, canonical product of sums

• F2(A,B) = AB - Canonical sum of products, standard product of sums

Lec Md Shadman Aadeeb, Dept. of CSE 29


2/12/2023
Standard Form and Canonical Form

Understanding Min Terms

If there are a total of 8 combinations

Then there are 8 min terms.

The min terms for each of the 8


combinations are shown in the table

Denoted by mi

Lec Md Shadman Aadeeb, Dept. of CSE 30


2/12/2023
Standard Form and Canonical Form

Understanding Min Terms

If there are a total of 8 combinations

Then there are 8 min terms.

The min terms for each of the 8


combinations are shown in the table

Denoted by Mi

Lec Md Shadman Aadeeb, Dept. of CSE 31


2/13/2023
Standard Form and Canonical Form

• We have a chip, we want to know what is the Boolean function


making it work

X F
Y A Chip
Z

Lec Md Shadman Aadeeb, Dept. of CSE 32


2/12/2023
Standard Form and Canonical Form

• We try out all possible combinations

Lec Md Shadman Aadeeb, Dept. of CSE 33


2/12/2023
Standard Form and Canonical Form

• What is the FUNCTION?

Canonical sum of products

Lec Md Shadman Aadeeb, Dept. of CSE 34


2/12/2023
Standard Form and Canonical Form

• What is the FUNCTION?

Canonical product of sums

Lec Md Shadman Aadeeb, Dept. of CSE 35


2/12/2023
Standard Form and Canonical Form

Using De Morgans:

Lec Md Shadman Aadeeb, Dept. of CSE 36


2/12/2023
Standard Form and Canonical Form

We can simplify canonical forms to get standard forms.

F= X’YZ + XY’Z + XYZ’ + XYZ

F= XY +YZ +ZX

Lec Md Shadman Aadeeb, Dept. of CSE 37


2/12/2023
Standard Form and Canonical Form

• Why are both the forms expressed as sums of products or products of


sum?

Keeping 2 levels of circuit


Hence Less effect of gate delay
Lec Md Shadman Aadeeb, Dept. of CSE 38
2/12/2023
Karnaugh Maps

2/13/2023 Lec Md Shadman Aadeeb, Dept. of CSE 39


Remember the problem with Boolean Algebra?

Issues with using Boolean algebra


• Not organized
• Trial and error based approach
• Not always minimal

Lec Md Shadman Aadeeb, Dept. of CSE 40


2/13/2023
Remember the problem with Boolean Algebra?

• F= A’BC’ + AB’C’ + AB’C + ABC’ +ABC


• Try to simplify it

Lec Md Shadman Aadeeb, Dept. of CSE 41


2/13/2023
Lets use a truth table

Build a truth table for this function:

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

Lets see if there is an easier way to simplify

Lec Md Shadman Aadeeb, Dept. of CSE 42


2/13/2023
Summary

If you are given a function which you want to simplify then,


⮚ Build a truth table
⮚ Place the values in a Kmap
⮚ Group the adjacent 1’s
⮚ Simplify

Lec Md Shadman Aadeeb, Dept. of CSE 43


2/13/2023
Thank You

2/12/2023 Lec Md Shadman Aadeeb, Dept. of CSE 44

You might also like