电子科大微电子考研资料数字逻辑4-3.pdfVIP

  • 0
  • 0
  • 约3.41千字
  • 约 17页
  • 2026-02-09 发布于山东
  • 举报

电子科大微电子考研资料数字逻辑4-3.pdf

Minimizationofthelogiccircuit

byKarnaughmap

Karnaughmapanditsproperty

Relationbetweenkaraughmapandlogic

equations

Stepsforminimization

Karnaughmap

2DFigurefortruthtable

PropertiesofKarnaughmap

Eachcellmaybeamintermoramaxterm;

ThecoordinatesareorderedinGraycodes;

Eachcelldiffersfromitsneighborsinonly

onevariable!

Standardlogicequationand

theirKarnaughmap

MintermlistMaxtermlist

CanonicalsumCanonicalproduct

F=()F=(0,4,5,6)

A,B,C1,2,3,6A,B,C

Logicequationsandtheir

Karnaughmap

SumofproductProductofsum

()

FA,B,C=AC+BCF()()()

A,B,C=A+CB+C

Samelogicwithdifferentforms

Propertiesofneighborcells

F=m2+m6

=ABC+ABC

=BC

Fm2+m6+m3+m7

BC+BCB

Canbeminimizedbykarnaughmap

Minimalsum

Getaminimalproduct-sumequation

Step1:Makerectangularsetsof1s

Coverallthe1sintheKanaughmaps;

i

Thecell-numbersinanysetsmustbe2;

Thenumberofsetsmustbeminimal!

Eachsetmustbemaximal!

(Any1scanbereusedintheprocess!)

Minimalsum

Step1:Makerectangularsetsof1s

examples:

Minimalsum

S

文档评论(0)

1亿VIP精品文档

相关文档