Scribd
Upload
596 views27 pages

7 Segment Led

This document discusses Karnaugh maps and their use in logic minimization. It begins by outlining K-maps for 4 and 5 variables and discusses identifying prime implicants and essential prime implicants. It then provides examples of using K-maps to find minimum sum-of-products solutions for logic functions with up to 6 variables. The key concepts covered are using K-maps to identify groups of 1s to find prime implicants, distinguishing essential from non-essential prime implicants, and determining the minimum number of prime implicants needed to fully cover the 1s in the map.

Uploaded by

Nikhil Bhati
Copyright
© Attribution Non-Commercial (BY-NC)
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
596 views27 pages

7 Segment Led

This document discusses Karnaugh maps and their use in logic minimization. It begins by outlining K-maps for 4 and 5 variables and discusses identifying prime implicants and essential prime implicants. It then provides examples of using K-maps to find minimum sum-of-products solutions for logic functions with up to 6 variables. The key concepts covered are using K-maps to identify groups of 1s to find prime implicants, distinguishing essential from non-essential prime implicants, and determining the minimum number of prime implicants needed to fully cover the 1s in the map.

Uploaded by

Nikhil Bhati
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 27

CS221:DigitalDesign

KMapLogicMinimizationContd..

Dr.A.Sahu DeptofComp.Sc.&Engg. IndianInstituteofTechnologyGuwahati


1

Out e Outline
Karnough mapsimplification
4variable i bl karnaugh k h map Dontcarecondition Algorithmforbettergrouping

Karnaugh mapwith> >=5variable

4VariableKarnaugh g Map p
CD AB
00 01 11 10 00
m0 m4

CD
01
m1 m5

11
m3 m7

10
m2 m6

AB
00 01 11 10

00

01

11

10

0 1 1 0

0 1 1 1

0 1 1 0

1 1 1 0

ACD

m12 m13 m15 m14 m8 m9 m11 m10

ACD
F = ACD + ACD + B

Note the row and column orderings. Required for adjacency

FindaPOSSolution
AB CD
00 01 00 01 11 10

AD
1 0 1 1 0 0 1 1 0 0 1 1 1 0 1 0
F=AD+AB+ABCD F=( (A+D)(A+B)(A+B+C+D) )( )( )

AB

11 10

ABCD Find solutions to groups of 0s to find F Invert to get F then use DeMorgans

Dont Don tCare


A don'tcareterm isaninputtoafunction thatthedesignerdoesnotcareabout Becausethatinput p wouldneverhappen pp Example:
BCDnumber(09, 9 AF)are4bits, bits don dont tcareabout inputAF Supposeasystemhave5typeofinput
Unfortunatelywecanthave2inputline Make3inputlineandlast3sequenceasdontcare S0,S1,S2,S3,S4,X,X,X==>000,001.,111
5

DealingWithDont Don tCares F=m(1,3,7)+d(0,5)


A BC
00 01 0 1

x 1 1 0

0 x 1 0

ABC+ABC+ ABC+ABC =C

11 10

F=C

Circle the x xs s that help get bigger groups of 1 1s s Dont circle the xs that dont

7SegmentDisplay
a

f g

e d

a f e d g b c

ActivationofLEDs

0:a,b,c,d,e,f 1 b,c 1: bc 2:a,b,g,e,d , ,g, , 3:a,b,g,c,d 4:f,g,b,c

5:a,f,g,c,d 5 f d 6:a,f,g,c,d,e 7:a,b,c 8:a,b,c,d,e,f,g 9 a b c d fg 9:a,b,c,d,f,g


8

BCDto7SegmentDisplay
BCDare4bit Designadecodertodrive7segmentLED
A B C D E F G

BCD input

W X Y Z

Decoder

PrimeImplicants
Agroupofoneormore1 1s swhichareadjacent andcanbecombinedonaKarnaugh Mapis calledanimplicant. implicant Thebiggest groupof1swhichcanbecircled tocoveragiven1iscalledaprimeimplicant. implicant

Theyaretheonlyimplicants wecare about.

PrimeImplicants
AB CD
00 01 11 10 00 01 11 10

Prime i Implicants li Non-prime i Implicants li

0 0 0 0

0 0 1 1

0 1 1 1

1 1 1 1

Are there any additional prime implicants in the map that are not shown above?

All The Prime Implicants


AB CD
00 01 11 10 00 01 11 10

Prime i Implicants li

0 0 0 0

0 0 1 1

0 1 1 1

1 1 1 1

When looking for a minimal solution only circle prime implicants A minimal i i l solution l i will ill never contain i non-prime implicants

Essential Prime Implicants


AB CD
00 01 11 10 00 01 11 10

Not all prime implicants are required required A prime implicant which is the only l cover of f some 1 is i essential i l a minimal solution requires it.

0 0 0 0

0 0 1 1

0 1 1 1

1 1 1 1

Essential Prime Implicants

Non essential Prime Implicants Non-essential

A Minimal Solution Example


AB CD
00 01 11 10 00 01 11 10
F = AB + BC + AD

Minimum

0 0 0 0

0 0 1 1

0 1 1 1

1 1 1 1
Not required q

Another Example
AB CD
00 01 11 10 00 01 11 10

1 1 1 1

0 1 1 0

0 0 1 0

1 0 0 1

AnotherExample
AB CD
00 01 11 10 00 01 11 10

1 1 1 1

0 1 1 0

0 0 1 0

1 0 0 1
AB is not required Every one one of its locations ocat o s is s cove covered ed by multiple implicants After choosing essentials, essentials everything is covered

F= AD+BCD+BD
Minimum

Finding the Minimum Sum of Products 1.Fi 1 Find deach hessential i l prime i implicant i li andincludeitinthesolution. 2.Determineifanyminterms arenot yet tcovered. d 3.Findtheminimal#ofremaining primeimplicants whichfinishthe cover.

YetAnotherExample ( (Use of fnonessential lprimes) )


AB CD
00 01 11 10 00 01 11 10

1 0 1 1

1 0 1 1

0 1 1 0

0 1 1 0

YetAnotherExample ( (Use of fnonessential lprimes) )


AB CD
00 01 00 01 11 10

1 0 1 1

1 0 1 1

0 1 1 0

0 1 1 0

AD CD

AC

11 10

Essentials:ADandAD Nonessentials:ACandCD Solution:AD+AD+AC or AD+AD+CD

AD

5VariableKarnaugh Map
BC DE
00 01 11 10 00 01 11 10

BC DE
00 01 11 10 00 01 11 10

m0 0 m4 4 m12 12 m8 8 m1 m5 m13 m9 m3 m7 m15 m11 m2 m6 m14 m10

m16 m20 m28 m24 m17 m21 m29 m25 m19 m23 m31 m27 m18 m22 m30 m26

ThisistheA=0plane

ThisistheA=1plane

The p planes are adjacent j to one another (one ( is above the other in 3D) )

SomeImplicants ina5VariableKMap
BC DE
00 01 11 10 00 01 11 10

BC DE
00 01 11 00 01 11 10

1 0 0 1

1 0 0 0

1 0 1 1

1 0 0 0

1 0 1 1

1 0 0 0

1 0 0 0

1 0 1 0

DE

10

A 0 A=0

ABCD

A 1 A=1
ABCD

ABCDE ABC DE

BCDE

Some of these are not prime

5VariableKMap Example
Find i d the h minimum i i sum-of-products f d f for: F=m( (0,1,4,5,11,14,15,16,17,20,21,30,31) , , , , , , , , , , , , )

BC DE
00 01 11 10 00 01 11 10

BC DE
00 01 11 10 00 01 11 10

A=0

A=1

5VariableKMap Example
Find the minimum sum-of-products for: F = m (0 ( ,1,4,5,11,14,15,16,17,20,21,30,31) (0,1,4,5,11,14,15,16,17,20,21,30,31) )

BC DE
00 01 11 10 00 01 11 10

BC DE
00 01 11 10 00 01 11 10

1 1 0 0

1 1 0 0

0 0 1 1

0 0 1 0

1 1 0 0

1 1 0 0

0 0 1 1

0 0 0 0

A=0 F=BD+BCD+ABDE

A=1

CD EF
00

6VariableKarnaugh Map
CD
00 01 11 10

EF
00 01

00

01

11

10

m0 m4 m12 m8 m1 m5 m13 m9 m3 m7 m15 m11 m2 m6 m14 m10


00 01 11 10

m32 m36 m44 m40 m33 m37 m45 m41 m35 35 m39 39 m47 47 m43 43 m34 m38 m46 m42

AB=0001
11 10

11 10

AB=10

CD EF
00

CD EF
00 01 11 10 00 m48 m52 m60 m56 01 m49 m53 m61 m57 11 m51 m55 m63 m59 10 m50 m54 m62 m58

m16 m20 m28 m24 m17 m21 m29 m25 m19 m23 m31 m27 m18 m22 m30 m26

AB=01

01 11 10

AB=11

CD EF
00 01 11 10 00 01 11 10

CD EF
00 01 11 10 00 01 11 10

0 0 0 0

0 0 0 0

0 0 1 0

0 0 0 0

1 1 1 1

0 0 0 0

0 0 1 0

0 0 0 0
AB=10

AB=00

CD EF
00 01 00 01 11 10

CD EF
00 01 11 10 00 01 11 10

0 0 0 0

0 0 0 0

0 0 1 0

0 0 0 0
=ACD

1 1 1 1

0 0 0 0

0 0 1 0

0 0 0 0
AB=11

AB=01
11 10

Solution=ACD+CDEF

=CDEF

KMap Summary
AKmapissimplyafoldedtruthtable
wherephysicaladjacencyimplieslogicaladjacency

KMapsaremostcommonlyusedhand g minimization methodforlogic KMapshaveotherusesforvisualizingBoolean equations


youmayseesomelater.

Thanks

27

You might also like