Please note all course content is exclusively for registered IIT-D ELL-201 students in current

semester. It is your responsibility to ensure no unauthorized circulation of the course

contents/materials takes place.

ELL 201: Digital Electronics

Lecture 6

Prof. Manan Suri (EE)

manansuri@ee.iitd.ac.in
http://web.iitd.ac.in/~manansuri/

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Recap:
• Any Boolean function can be expressed as a Product of Maxterms or
(Product of Sums) using its Truth Table

• Rule: Take the Product of all those Maxterms in the Truth Table that
have output as 0
Example:

Find F’

Minterms and Maxterms are complements! (mi)’ = Mi

M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Recap: Minterms →Maxterms

Example:

POS

Notice that indices are complementary

when moving from
POS → SOP

SOP

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Recap:

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Recap:

Each additional level → increases the length of datapath → increases the

propagation delays !!

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Recap: Karnaugh Maps & Gray Code
• K-maps: Graphical method for simplifying Boolean expressions
• Consists of 2^N cells for N variable system
• Exploits the principle of Adjacency → each adjacent cell must have change in only 1
variable

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
 Recap: Adjacency
Truth
Truth Table
Table Adjacencies
Adjacencies
Why look at Grey Codes? – concept of ADJACENCY

AA B B FF the selected boolean terms differ by just 1 literal

-Adjacency:
00 0-Adjacency
0 11 HelpsThese in simplification – when expressed in standard form
These adjacent
areadjacent
are inaagray
in graycode
codesense
sense
-Truth table based examples –
00 1 11
1Ex.1 -- they
theydiffer
differby
by11bit
bit
Tocan
We find the
canapply expression
apply XY++XY’ – express
XY’ ==XX in SOP form (minterms)
11 0A0 B00 F We XY
A’B’
A BB ++A’B
A’B’
A AA’B
ABB==A A’(B’+B)
A (B +B)
+B)==A
A’(B’+B)
(B A’(1)
A (1)==A
A’(1)
(1) A’
A
A’
11 101 000 1
AA B B F F
0 1 1
00 1 00 0 00 0 Sameidea:
Same idea:A
A
A’BB++AB
BEx.2
A’B AB==BB
A B F A’B+AB=B
00 1 11 1 11 0
11 00 00 0 0 0
11 11 11 0 1 1
Physical Adjacency in TT
dea:
ea: 1Problem:
0
Problem: 0
not same as gray code
Physical
y adjacency
j
1 y 1 adjacency
Physical 1j y in truth
y in truth adjacency
code adjacencyallows
ode adjacency allowsuse
useof
of tabledoes
table doesnot notindicate
indicategray gray
fication theorems
ication theorems code
code adjacency
M. Suri, adjacency
ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Recap: Karnaugh Maps
• A K-Map exploits adjacency or in other words its at truth table with
physical adjacency
2 Variable Karnaugh Map
• K-Map for a N-variable system will have 2N cells, just like outputs of truth-
table
A B F
0 0
2 – variable K-map A In Minterms
0 1
y
1B
0 1 y
1 0x 0 0 1
x
1 1 0
0 x’y’ x’y 0 A=1,
m0 B=0
m1
A=0 B=0
A=0, 1
1 xy’ xy 1 m2 m3
A=1, B=1
A=0, B=1

A different
Basically way
you are to draw
folding a truth
the truth tabletable: byrepresenting
and then folding it it

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Recap: Karnaugh Maps
Steps to use a K-Map for simplification –

1.Using the given truth table or boolean expression fill out the corresponding
minterm cells with 1s (maxterm cells with 0s)

2.Make groups of adjacent minterm cells containing 1s (0s in case of

maxterm)
(note: number of cells in each group can only be a power of 2: 1,2,4...)

3.Each group in the K-map will give you a reduced/simplified literal

(from inspection, remove those literals that change across the group, and
retain only those that remain the same)

4. The final simplified expression can be expressed as a sum (or product) of

all reduced literals

Always try to make largest possible groups

M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Recap: Karnaugh Maps
Example 1

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Tentative Timeline
(Note: timeline may change during the semester without any prior notice → details are only of indicative nature)

Lec. No Content
1 Intro + Logistics + Course Policy + Motivation etc
2 Why digital, Number Systems + Conversions etc.
3 Fractional, Complements, Addn, Subtraction
4 Logic Gates, Boolean Algebra, Minterm, Maxterm, SOP, POS
5
KMaps, Minimization, XoR Gate
6
7 XOR Gate, Adders (half/full) + Parity bit circuits + 4-bit adder + subtraction +
8 overflow detection + BCD adder, Ripple Carry, CLA, 4-bit, 16-bit, 64-bit, Timing
9 Analysis, etc.
10
Mux + Decoder + Encoder-1
11
12 PB Set/Assignment or as per need
Minor week
13
14
Sequential Logic - Latches. Flip flops, varieties, counters, registers, digital CMOS,
15
Verilog intro
16
17
18 PB Set/Assignment or as per need
Mid Sem Break
19
20 FSM intro, Moore, Mealy, Examples, Conversions etc.
21
22
Memory, Advanced topics, etc.
23
24 Extra/Buffer/Cover-up class/As per need
Major Exam Week
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
3 – Variable K-Maps: 8 cells

yz
yz
x 00 01 11 10
x

0 m0 m1 m3 m2

1 m4 m5 m7 m6

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
3 – Variable K-Maps: 8 cells

yz
11 10 yz
00 01
x 00 01 11 10
x
0 m0 m2
0 m1 m3

1
1 m4 m5 m7 m6

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
3 – Variable K-Maps: 8 cells

yz
11 10 yz
00 01
x 00 01 11 10
x
0 x’y’z’ x’y’z x’yz x’yz’
0 m0 m1 m3 m2

1 xy’z’ xy’z xyz xyz’

1 m4 m5 m7 m6

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
3 – Variable K-Maps: 8 cells
y

yz
11 10 yz
00 01
x 00 01 11 10
x
0 x’y’z’ x’y’z x’yz x’yz’
0 m0 m1 m3 m2

1 xy’z’ xy’z xyz xyz’ x

1 m4 m5 m7 m6

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
3 – Variable K-Maps: 8 cells
y

yz
00 01 11 10
x

0 x’y’z’ x’y’z x’yz x’yz’

1 xy’z’ xy’z xyz xyz’ x

Minterms
yz
00 01 11 10
z x

0 m0 m1 m3 m2

1 m4 m5 m7 m6

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
3 – Variable K-Maps: 8 cells
y

yz
00 01 11 10
x

0 x’y’z’ x’y’z x’yz x’yz’

1 xy’z’ xy’z xyz xyz’ x

Minterms
yz
00 01 11 10
z x

0 m0 m1 m3 m2

1 m4 m5 m7 m6

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh
1 1 0 Maps
6 1
F= A + B
B’C’
C + BC
BC’
Example
1 1 –1solve using
7 K-Map
1
Group of 4 Group of 2 Group of 2
F= m(0,2,4,5,6,7) m(4,5,7,6) m(2,6) m(0,4)

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh
1 1 0 Maps
6 1
F= A + B
B’C’
C + BC
BC’
Example
1 1 –1solve using
7 K-Map
1
Group of 4 Group of 2 Group of 2
F= m(0,2,4,5,6,7) m(4,5,7,6) m(2,6) m(0,4)

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example – solve using K-Map

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example – solve using K-Map

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
In 3 variable K-map, how many possible groups of 2? →____, literal size →_____

In 3 variable K-map, how many possible groups of 4? →_____, literal size →____

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
4 variable - Karnaugh Maps

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps – don’t care terms (x)
• A situation where exact value does not matter between 1 and 0

• Represented by ‘x’ and ‘d (index)’

• Hardware Designer can assign either ‘1’ or ‘0’ to don’t care state, that helps
in simplification

• Normally choose ‘d’ or ‘x’ such that larger groups can be constructed to
simplify

Example:
F = ∑m(1,3,7) + ∑ d(0,5)

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Implicants - Types
• Groups of 1s in your K-map
• Largest groups to cover given 1s – Prime Implicants
• We mainly care only about prime implicants

0 0 0 1

0 0 1 1 Prime

0 1 1 1 Non-Prime

0 1 1 1

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Implicants - Types
• Prime Implicants: Essential and Non-essential
Solution: ?? Prime implicant which is
Which implicant not in minimal solution?? the only cover of a
particular ‘1’ is :
essential prime implicant
0 0 0 1
Non-Essential
0 0 1 1

0 1 1 1

0 1 1 1
Essential

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Another
Example:
Example
AB
Step 1: First find all the prime
CD 00 01 11 10
implicants
00 1 0 0 1
Step 2: Identify the ones that are
01 1 1 0 0
essential
11 1 1 1 0
Step 3: Minimal Solution must contain
10 1 0 0 1
all Essential Prime Implicants

Step 4: Choose non-essential prime

implicants in your solution such that
there’s no left-over minterm

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)

1 1 1
1 1
1 1
1 1 1 1

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)

1 1 1
1 1
1 1
1 1 1 1

I1

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)

1 1 1
1 1
1 1 I2
1 1 1 1

I1

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)

1 1 1
1 1 I3
1 1 I2
1 1 1 1

I1

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)

1 1 1
1 1 I3
1 1 I2
1 1 1 1

I1
I4

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)

1 1 1
1 1 I3
I5
1 1 I2
1 1 1 1

I1
I4

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)

1 1 1
1 1 I3
I5
1 1 I2
1 1 1 1

I1
I4

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants

Non-Essential Prime Implicants

1 1 1
1 1 I3
I5
1 1 I2 Solution:
1 1 1 1

I1
I4

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants
I6 and I3
Non-Essential Prime Implicants
1 1 1
1 1 I3
I5
1 1 I2 Solution:
1 1 1 1

I1
I4

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants
I6 and I3
Non-Essential Prime Implicants
1 1 1
I1, I2, I4 , and I5,
1 1 I3
I5
1 1 I2 Solution:
1 1 1 1

I1
I4

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants
I6 and I3
Non-Essential Prime Implicants
1 1 1
I1, I2, I4 , and I5,
1 1 I3
1 1 Solution:
1 1 1 1 • F= I6 + I3 +

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants
I6 and I3
Non-Essential Prime Implicants
1 1 1
I1, I2, I4 , and I5,
1 1 I3
1 1 I2 Solution:
1 1 1 1 • F= I 6 + I 3 + I 1 + I2

I1

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants
I6 and I3
Non-Essential Prime Implicants
1 1 1
I1, I2, I4 , and I5,
1 1 I3
1 1 I2 Solution:
1 1 1 1 • F= I 6 + I 3 + I 1 + I2
• F= I6 + I3 + I2 + I4

I4

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants
I6 and I3
Non-Essential Prime Implicants
1 1 1
I1, I2, I4 , and I5,
1 1 I3
I5
1 1 Solution:
1 1 1 1 • F= I 6 + I 3 + I 1 + I2
• F= I6 + I3 + I2 + I4
• F= I6 + I3 + I5 + I4
I4

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants
I6 and I3
Non-Essential Prime Implicants
1 1 1
I1, I2, I4 , and I5,
1 1 I3
I5
1 1 Solution:
1 1 1 1 • F= I6 + I3 + I1 + I2
• F= I6 + I3 + I2 + I4
• F= I6 + I3 + I5 + I4
I1 • F= I 6 + I3 + I 5 + I1

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
Karnaugh Maps
Example: F(A,B,C,D) = Σ (0,2,3,5,7,8,9,10,11,13,15)
Essential Prime Implicants
I6 and I3
Non-Essential Prime Implicants
1 1 1
I1, I2, I4 , and I5,
1 1 I3
I5
1 1 Solution:
1 1 1 1 • F= I6 + I3 + I1 + I2
• F= I6 + I3 + I2 + I4
• F= I6 + I3 + I5 + I4
I1 • F= I 6 + I3 + I 5 + I1

I6
M. Suri, ELL201, 2021 (copyright IITD) "Intended for
Academic Fair Use Only"
 Thank you

M. Suri, ELL201, 2021 (copyright IITD) "Intended for

Academic Fair Use Only"