Scribd
Upload
278 views10 pages

Min Terms and Maxterms

Minterms and maxterms are canonical forms for representing Boolean functions. A minterm is a product term containing all variables in their true or complemented form, while a maxterm is the complement of a minterm. Any Boolean function can be expressed as either the sum of minterms or the product of maxterms. Converting between these canonical forms involves applying De Morgan's laws and complementing terms. Standard forms have terms with varying numbers of literals and are more efficient than canonical forms.

Uploaded by

MARUPAKA BHARGAV ANAND BU21CSEN0400111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
278 views10 pages

Min Terms and Maxterms

Minterms and maxterms are canonical forms for representing Boolean functions. A minterm is a product term containing all variables in their true or complemented form, while a maxterm is the complement of a minterm. Any Boolean function can be expressed as either the sum of minterms or the product of maxterms. Converting between these canonical forms involves applying De Morgan's laws and complementing terms. Standard forms have terms with varying numbers of literals and are more efficient than canonical forms.

Uploaded by

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

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 con be combined to form 2n minterms.
 A maxterm (standard sums): an OR term
 It is also call a standard sum.
 2n maxterms.

December 6, 2022 1
Minterms and Maxterms
 Each maxterm is the complement of its corresponding
minterm, and vice versa.

December 6, 2022 2
Minterms and Maxterms
 An Boolean function can be expressed by
 A truth table
 Sum of minterms
 f1 = x'y'z + xy'z' + xyz = m1 + m4 +m7 (Minterms)
 f2 = x'yz+ xy'z + xyz'+xyz = m3 + m5 +m6 + m7 (Minterms)

December 6, 2022 3
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
 A sum of minterms (“sum” meaning the ORing of terms).
 A product of maxterms (“product” meaning the ANDing of terms).
 Both boolean functions are said to be in Canonical form.

December 6, 2022 4
Sum of Minterms
 Sum of minterms: there are 2n minterms and 22n
combinations of function with n Boolean variables.
 Example 2.4: express F = A+BC' 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

December 6, 2022 5
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') = M M M M
0 2 4 5
 F(x, y, z) = (0, 2, 4, 5)

December 6, 2022 6
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 ' = M j
 Sum of minterms = product of maxterms
 Interchange the symbols  and  and list those numbers
missing from the original form
  of 1's
  of 0's

December 6, 2022 7
 Example
 F = xy + xz
 F(x, y, z) = (1, 3, 6, 7)
 F(x, y, z) =  (0, 2, 4, 6)

December 6, 2022 8
Standard Forms
 Canonical 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.
 Sum of products: F1 = y' + xy+ x'yz'
 Product of sums: F2 = x(y'+z)(x'+y+z')
 F3 = A'B'CD+ABC'D'

December 6, 2022 9
Implementation
 Two-level implementation

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

 Multi-level implementation

December 6, 2022 10

You might also like