組合部分小結(jié)+部分習(xí)題評(píng)講

1組合邏輯部分小結(jié)第4章組合邏輯設(shè)計(jì)原理第6章組合邏輯設(shè)計(jì)實(shí)踐2第4章基本原理

開(kāi)關(guān)代數(shù)基礎(chǔ)組合邏輯的基本分析、綜合方法冒險(xiǎn)

開(kāi)關(guān)代數(shù)的公理、定理對(duì)偶、反演規(guī)則邏輯函數(shù)的表示法

分析步驟，利用公式進(jìn)行化簡(jiǎn)設(shè)計(jì)方法、步驟利用卡諾圖化簡(jiǎn)，電路處理無(wú)關(guān)項(xiàng)的化簡(jiǎn)——

冒險(xiǎn)的檢查和消除3Switchingalgebraex1：prove(AB+A’C)’=AB’+A’C’4.47(a)Yes (b)No(c)Yesself-duallogicfunction:F=FDYesorNo?4Truthtable、canonicalsum、canonicalproduct、KarnaughmapLogicfunctiontruthtableStandardRepresentationoflogicfunction4.7(h)4.9(e)canonicalsum、canonicalproduct5Mintermandmaxtermex1:四個(gè)變量可以構(gòu)成()個(gè)最小項(xiàng)，它們之和是()。最小項(xiàng)m5和m10相與的結(jié)果為（）。StandardRepresentationoflogicfunctionex2:Forasamelogicfunction,accordingtotherelationshipbetweenmaxtermMiandmintermmi,wehaveMi=（），Mi+mi=（）.6卡諾圖化簡(jiǎn)：最小積之和：圈1最小和之積：圈0；F取非后圈1再取非。邏輯函數(shù)的化簡(jiǎn)4.15(e)4.18(b)4.58(b)4.59(a)7Complementsum(完全和)：對(duì)于一個(gè)邏輯函數(shù)，下列哪個(gè)說(shuō)法是不正確的（)。

a)最小和邏輯表達(dá)式肯定唯一

b)標(biāo)準(zhǔn)和邏輯表達(dá)式肯定唯一

c)標(biāo)準(zhǔn)積邏輯表達(dá)式肯定唯一

d)完全和邏輯表達(dá)式肯定唯一Thesumofalltheprimeimplicantsofalogicfunction.4.17(d)8組合電路的分析分析的目的：確定給定電路的邏輯功能分析步驟：由輸入到輸出逐級(jí)寫(xiě)出邏輯函數(shù)表達(dá)式對(duì)輸出邏輯函數(shù)表達(dá)式進(jìn)行化簡(jiǎn)判斷邏輯功能（列真值表或畫(huà)波形圖）9例：下圖為一可控函數(shù)發(fā)生器，其中C1、C2為控制端，A、B為輸入變量，F(xiàn)為輸出變量。C1、C2的取值如表所示，完成此表。C1C2F=f(A,B)0001101110例：分析圖示邏輯電路的功能B3B2B1B0G3G2G1G0解：1、寫(xiě)表達(dá)式2、列真值表3、分析功能0000000100100011010001010110011110001001101010111100110111101111B3B2B1B0G3G2G1G0000000010011G3=B3G2=B3B2G1=B2B1G0=B1B0二進(jìn)制碼至GRAY碼的轉(zhuǎn)換電路0010011001110101010011001101111111101010101110011000GRAY碼至二進(jìn)制碼的轉(zhuǎn)換?11組合電路的綜合問(wèn)題描述邏輯抽象選定器件類(lèi)型函數(shù)化簡(jiǎn)電路處理將函數(shù)式變換電路實(shí)現(xiàn)真值表或函數(shù)式用門(mén)電路用MSI組合電路或PLD12X1X0X3X200

01

11

1000011110Y3=X3X1X0X3X200

01

11

1000011110Y2=X3X2+X3X1+X3X0+X2X1X0d11dd1d1dd1d1dd11d1dd1Homework:Designacodetransformationcircuitwhichcantransformexcess-3codeto2421code(fig.2-9).Itisrequiredthatthecircuithastheminimumcost.13X1X0X3X200

01

11

1000011110Y0=X0’X1X0X3X200

01

11

1000011110d111dddd1d1d11d1dd1d1dY1=X3X1’X0’+X3’X1’X0

+X3X1X0+X3’X1X0’

Homework:Designacodetransformationcircuitwhichcantransformexcess-3codeto2421code(fig.2-9).Itisrequiredthatthecircuithastheminimumcost.14例：設(shè)計(jì)用3個(gè)開(kāi)關(guān)控制一個(gè)電燈的邏輯電路，要求改變?nèi)魏我粋€(gè)開(kāi)關(guān)的狀態(tài)都能控制電燈由亮變滅或者由滅變亮。輸入：A、B、C，輸出：F（1-燈亮，0-燈滅）000001010011100101110111ABCF011010011、填寫(xiě)真值表2、選擇器件

用基本門(mén)電路實(shí)現(xiàn)利用卡諾圖化簡(jiǎn)用譯碼器實(shí)現(xiàn)轉(zhuǎn)換為最小項(xiàng)之和用數(shù)據(jù)選擇器實(shí)現(xiàn)154.61completethetimingdiagram16statichazards4.19(c)

Doesthereexistanyhazardineachcircuitcorrespondingtothefollowinglogicexpressions?Ifso,whatkindofhazardmayoccur,underwhatinputconditionthehazardwilloccur,andhowtoeliminatethehazard?

(a)F=AB+AC’+C’D(b)F=(A+B’)(A’+C’)

0

0

0CAB0001111001

0F=(A+B’)(A’+C’)(B’+C’)F=(A+B’)(A’+C’):WhenB=C=1andAchanges,thecircuithasstatic-0hazard.

17第6章設(shè)計(jì)實(shí)踐常用的中規(guī)模集成電路（MSI）編碼器、譯碼器、多路復(fù)用器、奇偶校驗(yàn)電路、

比較器、加法器、三態(tài)器件掌握基本功能，級(jí)聯(lián)的方法綜合應(yīng)用：利用基本MSI器件作為基本單元設(shè)計(jì)更復(fù)雜的組合邏輯電路文檔標(biāo)準(zhǔn)和電路定時(shí)（了解）186.20(c)(g)(h)196.41designacustomizeddecoder利用MSI和SSI部件，設(shè)計(jì)專(zhuān)用譯碼器，其功能表如下表所示，在你的設(shè)計(jì)中要使IC組件的數(shù)目最少。

輸入：A2、A1、A0，使能信號(hào)CS_L輸出：8位2021………22input：8421BCDcodeoutput：1-out-of-10codeY0Y9I0I1I2I3多余的6個(gè)狀態(tài)如何處理？輸出均無(wú)效：拒絕“翻譯”作為任意項(xiàng)處理6.38

Supposethatyouareaskedtodesignanewcomponent,adecimaldecoderthatisoptimizedforapplicationsinwhichonlydecimalinputcombinationsareexpectedtooccur.Howcanthecostofsuchadecoderbeminimizedcomparedtoonethatissimplya4-to-16decoderwithsixoutputsremoved?Writethelogicequationsforalltenoutputsoftheminimizeddecoder,assumingactive-highinputsandoutputsandnoenableinputs.MinimalcostMinimalrisk23二-十進(jìn)制譯碼器00000001001000110100010101100111100010011010101111001101111011111000000000010000000000100000000001000000

000010000000000100000000001000000000010000000000100000000001000000000000000000000000000000000000000000000000000000000000I3

I2

I1

I00123456789Y0

Y9偽碼任意項(xiàng)24Y0=I3’·I2’·I1’·I0’（minimalrisk）I1I0I3I2000111

1000011110Y01ddddddY0=I3’·I2’·I1’·I0’（minimalcost）Y2=I3’·I2’·I1·I0’I1I0I3I2000111

1000011110Y21ddddddY2=I2’·I1·I0’I1I0I3I2000111

1000011110Y91Y9=I3·I2’·I1’·I0ddddddY9=I3·I025A2A1A0GSEOEI74x148I7I0I0_LI7_LA2A1A0AVALID6.53Drawthelogicdiagramforacircuitthatresolvespriorityamongeightactive-lowinputs,I0_L–I7_L,whereI0_Lhasthehighestpriority.Thecircuitshouldproduceactive-highaddressoutputsA2–A0toindicatethenumberofthehighest-priorityassertedinput.Ifatleastoneinputisasserted,thenanAVALIDoutputshouldbeasserted.Besuretonameallsignalswiththeproperactivelevels.Thiscircuitcanbebuiltwithasingle74x148andnoothergates.26A3A2A1A0FA3A2A1A0F00001100000001010011001001010000111101100100