资源描述
单击此处编辑母版文本样式,第二级,第三级,第四级,第五级,*,单击此处编辑母版标题样式,单击此处编辑母版文本样式,第二级,第三级,第四级,第五级,单击此处编辑母版标题样式,单击此处编辑母版文本样式,第二级,第三级,第四级,第五级,单击此处编辑母版标题样式,LOGO,*,单击此处编辑母版文本样式,第二级,第三级,第四级,第五级,单击此处编辑母版标题样式,LOGO,*,单击此处编辑母版文本样式,第二级,第三级,第四级,第五级,单击此处编辑母版标题样式,LOGO,*,.06.11,UESTC,数电加油站,lesson-1,第1页,Preface,1,Talents come from diligence and knowledge is gained by accumulation.,2,亡羊补牢,未为晚也,3,加油!,第2页,统计表,一、数字逻辑设计:,组合逻辑电路分析题,9%,组合逻辑电路设计题,8%,时序电路器件原理了解,12%,D,触发器、,J-K,触发器等,13%,时序:二进制计数器分析与设计,13%,时序:移位存放器分析与设计,10%,时序:移位存放型计数器分析与设计,12%,时序电路分析与设计中重点步骤:状态图、波形图,16%,这些都太简单,我只有直接回复订阅号告诉你们了!,2%,听课目标,只要考试能过就行啊,查漏补缺有所提升,26%,我可是为了刷到满绩来,73%,提升学科能力才是最主要(文件查找、试验设计),学习学科前沿知识,第3页,学习步骤,Step 1,Step 2,Step 3,期中前主要知识点整理,第七章重点知识点整理,第八章重点知识点整理,Step 4,综合复习,OK,第4页,考试重点-题型与主要内容,题型:填空、选择题、分析题、设计题。,内容主要:期中考试以后学习内容,占,70-80%,以上。另外如数选、二进制译码器及以前部分内容可能会在大题中使用。,第5页,考试重点-组合部分,1,、三态器件、异或门、校验电路和比较器,2,、加法器、累加器和组合乘法器,3,、数据选择器、二进制译码器,4,、,卡诺图化简,5,、,BCD,码等基本知识应用,第6页,考试重点-时序部分-第7章,1,、锁存器结构与性能,2,、,D,触发器结构性能及相关电路,3,、有限状态机表示和分析,计数器、序列信号发生器,序列信号检测器,状态分析、转移列表设计、系统分解设计,4,、同时状态机概念,第7页,考试重点-时序部分-第8章,二进制计数器规模化设计,二进制计数器经典应用,移位存放器结构和经典应用,移位存放器型计数器应用,时序部分,-,第,9,章,ROM,基本概念,A/S,D/A,第8页,一、组合电路重点知识回顾,进制转换(,10,2,8,16,),补码系统(概念、运算),编码(,8421BCD,2421BCD,余,3,码,格雷码),关于函数基本概念,表示一个函数方法,经典芯片利用(二进制译码器、显示译码器、数据选择器、优先编码器、,全加器、比较器、奇偶校验电路,),第9页,NOTES:,bit,(位),1 byte(1,个字节,)=8bits,MEMORY:256M=256M Bytes,1KB=1024 Bytes,1MB=1024*1024 Bytes,1GB=1024*1024*1024 Bytes,第10页,进制转换(,10,2,8,16,),What is the range of representable number,if you have n-bit binary number?,02n-1,十进制转二进制,整数部分转换:除以,2,取余,倒着数。,小数部分转换:乘,2,取整,正着数。,八进制转二进制,十六进制转二进制,第11页,Sum up for theComplement (,总结,),Complement Number Systems,signed-magnitude system,(010001),(101111),(010001),(,1,10001),+17,10,-17,10,不变,+17,10,-17,10,符号位改变,符号位不变其,余按位取反加,1.,连同符号位一起按位取反加,1.,连同符号位一起按位取反加,1.,符号位改变,第12页,Sum up for the Complement (,总结,),1.Positive number has the same,:,Sign-Magnitude,Ones Complement,and Twos-Complement,(,正数原码、反码、补码相同,),2.MSB(the sign bit):,1=minus;0=plus,Weight of the MSB:-2,n-1,第13页,2.6,Twos Complement Addition and Subtraction,(,二进制补码加法和减法,),we define,x,to be the twos,complement representation of,x,x,+,y,=(,x,+,y,),x,-,y,=(,x,+-,y,),x,为,x,在补码系统中表示。,X,为,6,10,,,x,为,0110,2s-complement,X,为,-6,10,,,x,为,1010,2s-complement,注意区分:,x,在补码系统中表示,x,和,对一个数,x,求补码为,2,n,-x,区分,!,第14页,2.6.3 the rule for detecting overflow,(溢出判断规则),(P41),1.,对于二进制补码,加数符号相同,和符号与加数,符号不一样,则,有溢出,.,2.,最高数值位产生进位与符号位产生进位,不一样,则,有溢出,.,3.,扩展符号位后运算,判断运行结果中两个符号位是否相同,不一样则有溢出,.,第15页,第16页,BCD(8421),码,2421,码,余,3,码,(excess-3),二五混合码,(biqunary code),(,an error-detecting property,含有检错特征,),10,中取,1,码(,1-out-of-10 code,),加权码,(,Weighted Code,),自反码,(self-complementing),Table 2-9(P49).(P50),第17页,格雷码,第18页,Duality and Complement(,对偶和反演,),(P194.P195),对偶,(Duality),:,F,D,(X,1,X,2,X,n,+,),=F(X,1,X,2,X,n,+,),反演,(Complement),:,F(X,1,X,2,X,n,+,),=F(X,1,X,2,X,n,+),F(X,1,X,2,X,n,)=F,D,(X,1,X,2,X,n,),正逻辑约定和负逻辑约定互为对偶关系,第19页,Truth table,真值表,product term,乘积项,sum term,求和项,sum-of-products expression,“,积之和”表示式,product-of-sums expression,“,和之积”表示式,n,-variable,minterm,n,变量最小项,n,-variable,maxterm,n,变量最大项,normal terms,标准项,canonical sum,标准和,canonical product,标准积,最小项之和,最大项之积,4.1.6 Standard Representations of Logic Functions(P196),第20页,ABC,ABC,ABC,ABC,ABC,ABC,ABC,ABC,m,0,m,1,m,2,m,3,m,4,m,5,m,6,m,7,minterm,0 0 0 0,0 0 1 1,0 1 0 2,0 1 1 3,1 0 0 4,1 0 1,5,1 1 0 6,1 1 1 7,A,B,C,row,A+B+C,A+B+C,A+B+C,A+B+C,A+B+C,A+B+C,A+B+C,A+B+C,M,0,M,1,M,2,M,3,M,4,M,5,M,6,M,7,maxterm,Minterms and Maxterms,m,5,?,M,5,第21页,F=,X,Y,Z,(0,3,4,6,7),=X.Y.Z+X.Y.Z,+X.Y.Z+X.Y.Z,+X.Y.Z,X,Y,Z,(0,3,4,6,7):,is a,minterm list,.,(,最小项列表,),“the sum of minterms 0,3,4,6,and 7 with,variables X,Y,and Z.”,第22页,F=,X,Y,Z,(1,2,5),=(X+Y+Z).,(X+Y+Z).(X+Y+Z),X,Y,Z(1,2,5),is a,maxterm list,.,(,最大项列表,),第23页,Relationship of Minterm and Maxterm,1,1,1,0,1,0,0,1,G,0 0 0 0,0 0 1 0,0 1 0 0,0 1 1,1,1 0 0 0,1 0 1,1,1 1 0,1,1 1 1 0,A,B,C,F,(ABC)=A+B+C,(ABC)=A+B+C,(ABC)=A+B+C,M,i,=m,i,m,i,=M,i,标号互补,第24页,Karnaugh Maps(P212,),step,填写卡诺图,圈组:找出能够合并最小项,组,(,圈,),数最少、每组,(,圈,),包含方块数最多,方格可重复使用,但最少有一个未被其它组圈过,圈组时应从合并数最小开始,读图:写出化简后乘积项,消掉既能为,0,也能为,1,变量,保留一直为,0,或一直为,1,变量,积之和形式:,0,反变量,1,原变量,第25页,4.4.1 Static Hazards,静态冒险,(P225),static-1 hazard,静态,-1,型冒险,static-0 hazard,静态,-0,型冒险,主要存在于,“与或”电路中,A,F,A,F,Steady state is 1.,F=(AA)=A+A,Steady state is 0.,F=(A+A)=AA,主要存在于,“或与”电路中,第26页,The,74x138,is a commercially available,MSI 3-to-8 decoder.,the 74x138 has,active-low outputs.,(P387),第27页,inputs,outputs,Enable output,使能输出,用于级联,EO,Group Select,(,选通输出,),GS,EI_L,有效,没有输入请求,EO_L,有效,Enable Inputs,使能输入,EI-L,EI_L,有效,有输入请求,GS_L,有效,P411,第28页,A,B,C,G1,G2A,G2B,Y0,Y1,Y2,Y3,Y4,Y5,Y6,Y7,74x138,EN1,EN2_L,EN3_L,SSRC0,SSRC1,SSRC2,冲突(,fighting,),利用使能端进行时序控制,.,三态器件允许信号共享单个“同线”(,party line,),经典三态器件,进入高阻态比离开高阻态快,P,Q,W,SDATA,第29页,EN_L C B A Y Y_L,1 X X X,0 0 0 0,0 0 0 1,0 0 1 0,0 0 1 1,0 1 0 0,0 1 0 1,0 1 1 0,0 1 1 1,0 1,D0 D0,D1 D1,D2 D2,D3 D3,D4 D4,D5 D5,D6 D6,D7 D7,Truth table for a,74x151 8-input,1-bit multiplexer.,A,B,C,P434,第30页,5.8.2 Parity Circuit,奇偶校验电路,什么是奇偶校验,?,奇偶校验位,+,一组信号位,基本定理:,基本概念:,使全部,1,加起来为偶数或奇数,来检测系统方法称为奇偶校验法。,A,0,A,1,A,n,=,1,变量为,1,个数是奇数,0,变量为,1,个数是偶数,odd-parity circuit,(奇校验电路),假如输入有奇数个,1,,则输出为,1,。,even-parity circuit,(偶校验电路),假如输入有偶数个,1,,则输出为,1,。,P448,第31页,The,74x280,9-bit parity generator,9,位奇偶校验发生器,74x280,(,P449,图,6,71,),A,B,C,D,E,F,G,H,I,EVEN,ODD,74x280,偶数个,1,时输出为,1,奇数个,1,时输出为,1,第32页,74x85,6.9.4 Standard MSI Comparators,the 74x85 4-bit comparator,A0,A1,A2,A3,ALTBIN,AEQBIN,AGTBIN,级联输入,用于扩展,ALTBOUT=(AB,高位,A,高位,=B,高位,&A,低位,B,低位,AB,AEQBOUT=(A=B)AEQBIN,AGTBOUT=(AB)+(A=B)AGTBIN,第33页,Serial Expanding Comparators(,比较器串行扩展,),XD11:0,YD11:0,3:0,7:4,11:8,XY,+5V,ABI,ABO,A0A3,B0B3,74x85,ABI,ABO,A0A3,B0B3,74x85,ABI,ABO,A0A3,B0B3,74x85,3,片,74x85,组成,12,位比较器,低位,高位,第34页,Adder,Half adder,第35页,Full adder,Adder,第36页,S/A=0:adder S/A=1:subtractor,Application of MSI adder:74x283,第37页,class-exercises,1,、,F=(A+B+D),(A+B+D),(A+B+D),(A+C+D),(A+C+D),F,D,=,?,F,=,?,2,、,Using Karnaugh maps,find a minimal sum-of-products expression for each of the following logic function F.Indicate the distinguished 1-cells in each map.,F=,A,B,C,D(0,1,2,3,4,5,7,14,15),第38页,TO FILL YOUR ANSWERS IN THE“”,(,2 X10,),1.2110=,00011111,GRAY (Assumed the number system is 8-bit long)2.ifX 10=+91,,,then X twos-complement=,01011011,2,,,-Xtwos-complement=,10100101,2(Assumed the number system is 8-bit long)3.To design a“1001001”serial sequence generator by shift registers,the shift register should need(,5,)bit at least.4.If use the simplest state assignment method for 133 states,,,then need at least,8,state variables,。,5.If number A twos-complement=11111001 and B twos-complement=11010101,calculate-A-B twos-complement,-A+B twos-complement and indicate whether or not overflow occurs.-A-B twos-complement=,00110010,overflow:,no,-A+B twos-complement=,11011100,overflow:,no,6.One state transition equation is Q*=JQ+KQ,。,If we use D flip-flop to complete the equation,,,the D input terminal of D flip-flop should be have the function D=,JQ+KQ,。,考卷实例,1,第39页,二,.Combinational Circuit Analysis:10,1,A 3-input truth table is shown below.Find the minimal,sum-of-products,expression for the output F.5,The output function,F=AB+AC+BC,第40页,2,To find,the minimal sum-of-products,expression of,F for F(X1,X2,X3,X4)=,(1,3,5,7,9,11,12,13,14,15),(F is complement of F),5,F=X1X4+X2X4,第41页,三,.,Try to finish logical function F(W,X,Y,Z)=WXYZ,(,3,6,7,10,11,14,),by one chip of 74X138 and one 8-input nand gate.10,解:,F(W,X,Y,Z)=,WXYZ,(,3,6,7,10,11,14,),=WXYZ+WXYZ+WXYZ+WXYZ+WXYZ+WXYZ,=Y,(,WX Z+WXZ+WXZ+WXZ+WXZ+WXZ,),=Y,WXZ,(,1,2,3,4,5,6,),第42页,Answer:,第43页,四,.4_bit adder 74xx283s function table is shown as below.,Design a combinational circuit with 4_bit input YY=(y,3,y,2,y,1,y,0,)and 6_bit output ZZ=(z5,z4,z1,z0)and to realize the function Z=6Y,using one chip of 74283 and none logic gates.(0,Y,9)10,GENERAL DESCRIPTION FOR 74XX283:,The 74HC283 add two 4-bit binary words(An plus Bn)plus the incoming carry.The binary sum appears on the sum outputs(SUM1 to SUM4)and the out-going carry(COUT)according to the equation:,CIN+(A1+B1)+2(A2+B2)+4(A3+B3)+8(A4+B4)=SUM1+2SUM2+4SUM3+8SUM4+16COUT,Where(+)=plus.,解:,Z=6Y=(4+2)Y=4Y+2Y=(y,3,y,2,y,1,y,0,00)+(0 y,3,y,2,y,1,y,0,0)=(z5,z4,z1,z0),第44页,第45页,三、,The circuit to the below realizes a combinational function F of four variables.Fill in the Karnaugh map of the logic function F realized by the multiplexer-based circuit.(6),第46页,下周四见!,第47页,
展开阅读全文