Scribd
Upload
10 views20 pages

Lecture 5 Slides-Min-Max

Uploaded by

2020n0800
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
10 views20 pages

Lecture 5 Slides-Min-Max

Uploaded by

2020n0800
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/ 20

Digital Logic Design

Chapter 2

Boolean Algebra and Logic Gate


Complement of a Function
• An interchange of 0's for 1's and 1's for 0's in the value of
F
– By DeMorgan's theorem
– (A+B+C)' = (A+X)' let B+C = X
= A'X' by theorem 5(a) (DeMorgan's)
= A'(B+C)' substitute B+C = X
= A'(B'C') by theorem 5(a) (DeMorgan's)
= A'B'C' by theorem 4(b) (associative)

Post. 1:
closure
Post. 2:
(a) x+0=x, (b) x·1=x
Post. 3:
(a) x+y=y+x, (b) x·y=y·x
Post. 4:
(a) x(y+z) = xy+xz,
(b) x+yz = (x+y)(x+z)
Post. 5: (a) x+x’=1, (b) x·x’=0
2
Examples
• Generalization: a function is obtained by interchanging
AND and OR operators and complementing each literal.
– (A+B+C+D+ ... +F)' = A'B'C'D'... F'
– (ABCD ... F)' = A'+ B'+C'+D' ... +F'

• Example 2.2
– F1' = (x'yz' + x'y'z)' = (x'yz')' (x'y'z)' = (x+y'+z)
(x+y+z’)

– F2' = [x(y'z'+yz)]’
= x' + (y'z'+yz)' = x' + (y'z')' (yz)‘
= x' + (y+z) (y'+z')
= x' + yz‘+y'z

3
2.6 Canonical and Standard Forms
Minterms and Maxterms
• A minterm (standard product): an AND term consists of
all literals in their normal form or in their complement
form.
– For example, two binary variables x and y,
• xy, xy', x'y, x'y'
– It is also called a standard product.
– n variables can be combined to form 2n minterms.
• A maxterm (standard sums): an OR term
– It is also call a standard sum.
– 2n maxterms.

4
Minterms and Maxterms
🞕 Each maxterm is the complement of its corresponding
minterm, and vice versa.

5
Minterms and Maxterms
• An Boolean function can be expressed by
– A truth table
– Sum of minterms for each combination of variables that
produces a (1) in the function.
– f1 = x'y'z + xy'z' + xyz = m1 + m4 +m7 (Minterms)
– f2 = x'yz+ xy'z + xyz'+xyz = m3 + m5 +m6 + m7 (Minterms)

6
Minterms and Maxterms
• The complement of a Boolean function
– The minterms that produce a 0
– f1' = m0 + m2 +m3 + m5 + m6 = x'y'z'+x'yz'+x'yz+xy'z+xyz'
– f1 = (f1')'

– = (x+y+z)(x+y'+z) (x+y'+z') (x'+y+z')(x'+y'+z) = M0 M2 M3 M5 M6


– f2 = (x+y+z)(x+y+z')(x+y'+z)(x'+y+z)=M0M1M2M4
– Any Boolean function can be expressed as terms).
– A product of maxterms (“product” meaning the ANDing of
terms).
– A sum of minterms (“sum” meaning the ORing of Both
boolean functions are said to be in Canonical form.
7
Sum of Minterms
• Sum of minterms: there are 2n minterms and 22n
combinations of functions with n Boolean variables.
• Example 2.4: express F = A+B’C as a sum of
minterms.
– F = A+B'C = A (B+B') + B'C = AB +AB' + B'C = AB(C+C') +
AB'(C+C') + (A+A')B'C = ABC+ABC'+AB'C+AB'C'+A'B'C
– F = A'B'C +AB'C' +AB'C+ABC'+ ABC = m1 + m4 +m5 + m6 +
m7
– F(A, B, C) = Σ(1, 4, 5, 6, 7)
– or, built the truth table first

8
Product of Maxterms
• Product of maxterms: using distributive law to expand.
– x + yz = (x + y)(x + z) = (x+y+zz')(x+z+yy') = (x+y+z)(x+y+z')(x+y'+z)
• Example 2.5: express F = xy + x'z as a product of
maxterms.
– F = xy + x'z = (xy + x')(xy +z) = (x+x')(y+x')(x+z)(y+z) = (x'+y)(x+z)
(y+z)
– x'+y = x' + y + zz' = (x'+y+z)(x'+y+z')
– F = (x+y+z)(x+y'+z)(x'+y+z)(x'+y+z') = M0M2M4M5
– F(x, y, z) = Π(0, 2, 4, 5)

9
Conversion between Canonical Forms
• The complement of a function expressed as the sum of
minterms equals the sum of minterms missing from the
original function.
– F(A, B, C) = Σ(1, 4, 5, 6, 7)
– Thus, F‘ (A, B, C) = Σ(0, 2, 3)
– By DeMorgan's theorem
F(A, B, C) = Π(0, 2, 3)
F'(A, B, C) =Π (1, 4, 5, 6, 7)
– mj' = Mj
• To convert from one canonical form to another:
interchange the symbols Σ and Π and list those numbers
missing from the original form
• Σ of 1's
• Π of 0's
10
• Example
– F = xy + x′z
– F(x, y, z) = Σ(1, 3, 6, 7)
– F(x, y, z) = Π (0, 2, 4, 6)

11
Standard Forms
• In canonical forms each minterm or maxterm must contain all
the variables either complemented or uncomplemented, thus
these forms are very seldom the ones with the least number of
literals.
• Standard forms: the terms that form the function may obtain
one, two, or any number of literals, .There are two types of
standard forms:
– Sum of products: F1 = y' + xy+ x'yz'
– Product of sums: F2 = x(y'+z)(x'+y+z')
• A Boolean function may be expressed in a nonstandard form
– F3 = AB + C(D + E)
• But it can be changed to a standard form by using The
. .

distributive law
– F3 = AB + C(D + E) = AB + CD + CE

12
Implementation
• Two-level implementation

F1 = y' + xy+ x'yz' F2 = x(y'+z)(x'+y+z')

Multi-level implementation

13
Boolean Expressions

14
Standard Gates
• Consider the 16 functions in Table 2.8
– Two functions produce a constant : (F0 and F15).
– Four functions with unary operations: complement and
transfer: (F3, F5, F10 and F12).
– The other ten functions with binary operators
• Eight function are used as standard gates :
complement (F12), transfer (F3), AND (F1), OR (F7),
NAND (F14), NOR (F8), XOR (F6), and equivalence
(XNOR) (F9).
– Complement: inverter.
– Transfer: buffer (increasing drive strength).
– Equivalence: XNOR.
15
Summary of Logic Gates

Figure 2.5 Digital logic gates


16
Summary of Logic Gates

Figure 2.5 Digital logic gates


17
Multiple Inputs
• Multiple NOR = a complement of OR gate, Multiple NAND =
a complement of AND.
• The cascaded NAND operations = sum of products.
• The cascaded NOR operations = product of sums.

Figure 2.7 Multiple-input and cascated NOR and


NAND gates
18
Multiple Inputs
• The XOR and XNOR gates are commutative and associative.
• Multiple-input XOR gates are uncommon?
• XOR is an odd function: it is equal to 1 if the inputs variables
have an odd number of 1's.

Figure 2.8 3-input XOR gate


19
Positive and Negative Logic

Figure 2.10 Demonstration of positive and negative logic


20

You might also like