Scribd
Upload
20 views17 pages

Chapter 02 Ee208

Uploaded by

Anonymous 001
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views17 pages

Chapter 02 Ee208

Uploaded by

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

Chapter 2:

Boolean Algebra

Digital Systems, EE-208

Dr. S.K.Vishvakarma, IIT Indore


Postulates and Theorems of Boolean Algebra
Truth Tables for
F1 = x+y’z and F2 =x’y’z+x’yz+xy’z’+xy’z’
Gate implementation of F1 = x + y′z
Implementation of Boolean function F2 =x’y’z+x’yz+xy’
with gates
1. Find the complement of the funtions
F1= x’yz’ + x’y’z and
F2 = x(y’z’ + yz)

2. Simplify the following Boolean functions to a minimum number of literals

1. x ( x’ + y) = xx’ + xy = 0 + xy = xy

2. x + x’y + (x + x’) (x+y) = 1 (x + y) + x + y

3. (x + y) (x + y”) = x + xy + xy’ + yy’ = z (1 + y + y’) = x

4. xy + x’z + yz = xy + x’z + yz (x + x’)


= xy + x’z + xyz + x’yz
= xy (1+z) + x’z (1+y)
= xy + x’z
Minterms and Maxterms for Three Binary Variables
Functions of Three Variables (Sum of Product (SOP) form
From the Given Truth Table

f1 = x’y’z + xy’z’ + xyz = m 1 + m4 + m7 &


f2 = x’yz + xy’z + xyz + xyz = m3 + m5 + m6 + m7
Complement of f1 = f1’ = x’y’z’ + x’yz’ + x’yz + xy’z + xyz’
Now the complement of f1’ = f1 = (x+y+z) (x +y’+z) (x+y’+z’)(x’+y+z’)(x’+y+z)
M0 . M2 . M3 . M5 . M6
Similarly f2 = M0 . M1 . M2 . M4
Ex 2.4 Express the Boolean function F= A + B’C as a sum of minterms.
The function has three variables A, B, C

A is missing two variables i.e.


A= A (B + B’) = AB + AB’
Still missing one variable, hence,
A= AB (C+C’) + AB’ (C+C’)= ABC + ABC’ + AB’C + AB’C’

The second term B’C is missing one variable hence,


B’C = B’C (A+A’) = AB’C + A’B’C
Hence, F= A+B’C = m 1 + m4 + m5 + m6 + m7
F (A,B,C) = Σ (1,4,5,6,7)
Oring
Alternative way is from Truth Table of the given function, read the
minterms

Truth Table for F = A + B’C

F= A+B’C = m1+ m4+m5+m6+m7


F (A,B,C) = Σ (1,4,5,6,7)
Product of Sum Form (POS)

EX 2.5: Express the Boolean function F= xy + x’z as a product of Maxterms.


First convert the function into OR terms by using the distributive law:
F= xy + x’z = (xy +x) (xy+z)
= (x+x’) (y+x’) (x+z) (y+z)
= (x’+y) (x+z) (y+z)
Further each term is missing one variable, hence
x’+y = x’ + y + zz’ = (x’ +y +z ) (x’ +y +z’)

x+z = x+z+yy’ = (x+y+z) (x+y’+z)

y + z = y+z+xx’=(x+y+z) (x’+y+z)
Combining all terms, F = M0 M2 M4 M5

Or F(x,y,z) = Π (0,2,4,5)
ANDing
Conversion between Canonical Forms

Consider a function F (A,B,C) = Σ(1,4,5,6,7)

The complement of this function can be expressed as,


F’ (A,B,C) = Σ (0,2,3) = m0+ m2+m3

Now if we take the complement of F’ by DeMorgon’s theorem,


We obtain F in three different form

F = (m0+m2+m3)’ = m0’ . m2’ . m3’ = M0 M2 M3 = Π (0,2,3)

Now from table (minterms and Maxterms, mj’=Mj


i.e. the maxterm with subscript j is a complement of the minterm
with the same subscriptj and vice versa
Consider the booean function F and hence, the
Truth Table for F = xy + x'z

F (x,y,z)= Σ(1,3,6,7) SOP


F (x,y,z) = Π (0,2,4,5), POS
Two‐level implementation

F1 = y’ + xy + x’yz’ (SOP) F2 = x(y’+z) (x’+y+z’) (POS)


Three‐ and two‐level implementation

F3 = AB + C (D+E) F3= AB + CD+ CE


Truth Tables for the 16 Functions of Two Binary
Variables
Boolean Expressions for the 16 Functions of Two
Variables

You might also like