Scribd
Upload
27 views

Digital Circuit Design - Module 2

DDCA

Uploaded by

Ghanshyam Agarwal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
27 views

Digital Circuit Design - Module 2

DDCA

Uploaded by

Ghanshyam Agarwal
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

DIGITAL CIRCUIT DESIGN

TRUTH TABLES

 Truth table: a unique representation of a Boolean function


 Tabular form that represents the relationship between the input variables of a function
and its output
 If two functions have identical truth tables, the functions are equivalent (and vice-
versa).
 Truth tables can be used to prove equality theorems.
 However, the size of a truth table grows exponentially with the number of variables
involved, hence unwieldy. This motivates the use of Boolean Algebra.
BOOLEAN EXPRESSIONS-NOT UNIQUE
x y z F G
0 0 0 1 1
 Unlike truth tables, expressions representing a Boolean
function are NOT unique. 0 0 1 0 0
 Example: 0 1 0 1 1
 F(x,y,z) = x’•y’•z’ + x’•y•z’ + x•y•z’
0 1 1 0 0
 G(x,y,z) = x’•y’•z’ + y•z’
 The corresponding truth tables for F(x,y,z) and G(x,y,z)
1 0 0 0 0
are to the right. They are identical. 1 0 1 0 0
 Thus, F(x,y,z) = G(x,y,z)
1 1 0 1 1
1 1 1 0 0
ALGEBRAIC MANIPULATION

 Boolean algebra is a useful tool for simplifying digital circuits.


 Why do it? Simpler can mean cheaper, smaller, faster.
 Example: Simplify F = x’yz + x’yz’ + xz.
F = x’yz + x’yz’ + xz
= x’y(z+z’) + xz
= x’y•1 + xz
= x’y + xz
CANONICAL AND STANDARD FORMS

 We need to consider formal techniques for the simplification of Boolean functions.

 Identical functions will have exactly the same canonical form.


 Minterms and Maxterms
 Sum-of-Minterms and Product-of- Maxterms
 Product and Sum terms
 Sum-of-Products (SOP) and Product-of-Sums (POS)
DEFINITIONS

 Literal: A variable or its complement


 Product term: literals connected by •
 Sum term: literals connected by +
 Minterm: a product term in which all the variables appear
exactly once, either complemented or actual literal
 Maxterm: a sum term in which all the variables appear
exactly once, either complemented or actual literal.
MINTERM
 Represents exactly one combination in the truth table.
 Denoted by mj, where j is the decimal equivalent of the
minterm’s corresponding binary combination (bj).
 A variable in mj is complemented if its value in bj is 0, otherwise
its value in bj is 1.
 Example: Assume 3 variables (A,B,C), and j=3. Then, bj = 011
and its corresponding minterm is denoted by

mj = A’BC
MAXTERM
 Represents exactly one combination in the truth table.
 Denoted by Mj, where j is the decimal equivalent of the
maxterm’s corresponding binary combination (bj).
 A variable in Mj is complemented if its value in bj is 1,
otherwise its value in bj is 0.
 Example: Assume 3 variables (A,B,C), and j=3. Then, bj = 011
and its corresponding maxterm is denoted by

Mj = A+B’+C’
TRUTH TABLE NOTATION FOR MINTERMS AND MAXTERMS
x y z Minterm Maxterm
0 0 0 x’y’z’ = m0 x+y+z = M0
 Minterms and Maxterms are 0 0 1 x’y’z = m1 x+y+z’ = M1
easy to denote using a truth
0 1 0 x’yz’ = m2 x+y’+z = M2
table.
0 1 1 x’yz = m3 x+y’+z’= M3
1 0 0 xy’z’ = m4 x’+y+z = M4
 Example:
Assume 3 variables x,y,z 1 0 1 xy’z = m5 x’+y+z’ = M5
(order is fixed)
1 1 0 xyz’ = m6 x’+y’+z = M6
1 1 1 xyz = m7 x’+y’+z’ = M7
CANONICAL FORMS (UNIQUE)

 Any Boolean function F( ) can be expressed as a


unique sum of minterms and a unique product of
maxterms (under a fixed variable ordering).
 In other words, every function F() has two canonical
forms:
 Canonical Sum-Of-Products (sum of minterms)
 Canonical Product-Of-Sums(product of maxterms)
CANONICAL FORMS (CONT.)
 Canonical Sum-Of-Products:
The minterms included are those mj such that F( ) = 1
in row j of the truth table for F( ).
F= ABC+ABC’+AB’C’

 Canonical Product-Of-Sums:
The maxterms included are those Mj such that F( ) = 0
in row j of the truth table for F( ).
F= (A’+B’+C’)(A’+B’+C)(A’+B+C)
EXAMPLE
 Truth table for f1(a,b,c) at right a b c f1
 The canonical sum-of-products form for f1 0 0 0 0
is
f1(a,b,c) = m1 + m2 + m4 + m6 0 0 1 1
= a’b’c + a’bc’ + ab’c’ + abc’
0 1 0 1
 The canonical product-of-sums form for f1 is
f1(a,b,c) = M0 • M3 • M5 • M7 0 1 1 0
= (a+b+c)•(a+b’+c’)• 1 0 0 1
(a’+b+c’)•(a’+b’+c’).
1 0 1 0
Observe that: mj = Mj’ 1 1 0 1
1 1 1 0
SHORTHAND: ∑ AND ∏
 f1(a,b,c) = ∑ m(1,2,4,6), where ∑ indicates that this is a sum-
of-products form, and m(1,2,4,6) indicates that the minterms to
be included are m1, m2, m4, and m6.

 f1(a,b,c) = ∏ M(0,3,5,7), where ∏ indicates that this is a


product-of-sums form, and M(0,3,5,7) indicates that the
maxterms to be included are M0, M3, M5, and M7.

 Since mj = Mj’ for any j,


F1(a,b,c) =∑ m(1,2,4,6) = ∏ M(0,3,5,7)
CONVERSION BETWEEN CANONICAL FORMS

 Replace ∑ with ∏ (or vice versa) and replace those j’s that appeared in the original
form with those that do not.
 Example:
f1(a,b,c) = a’b’c + a’bc’ + ab’c’ + abc’
= m1 + m2 + m4 + m6
= ∑(1,2,4,6)
= ∏(0,3,5,7)
= (a+b+c)•(a+b’+c’)•(a’+b+c’)•(a’+b’+c’)
STANDARD FORMS (NOT UNIQUE)

 Standard forms are “like” canonical forms, except that not all variables need appear
in the individual product (SOP) or sum (POS) terms.

 Example:
f1(a,b,c) = a’b’c + bc’ + ac’
is a standard sum-of-products form
 f1(a,b,c) = (a+b+c)•(b’+c’)•(a’+c’)
is a standard product-of-sums form.
CONVERSION OF SOP FROM STANDARD TO CANONICAL FORM
 Expand non-canonical terms by inserting equivalent of
1 in each missing variable x:
(x + x’) = 1
 Remove duplicate minterms

 f1(a,b,c) = a’b’c + bc’ + ac’


= a’b’c + (a+a’)bc’ + a(b+b’)c’
= a’b’c + abc’ + a’bc’ + abc’ + ab’c’
= a’b’c + abc’ + a’bc + ab’c’
CONVERSION OF POS FROM STANDARD TO CANONICAL FORM
 Expand noncanonical terms by adding 0 in terms of missing
variables (e.g., xx’ = 0) and using the distributive law
 Remove duplicate maxterms

 f1(a,b,c) = (a+b+c)•(b’+c’)•(a’+c’)
= (a+b+c)•(aa’+b’+c’)•(a’+bb’+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’)

You might also like