数字逻辑设计及应用教学英文课件:Lec21-Chap 08 counter

上传人:wox****ang 文档编号:157234239 上传时间:2020-12-21 格式:PPT 页数:20 大小:984KB
返回 下载 相关 举报
数字逻辑设计及应用教学英文课件:Lec21-Chap 08 counter_第1页
第1页 / 共20页
数字逻辑设计及应用教学英文课件:Lec21-Chap 08 counter_第2页
第2页 / 共20页
数字逻辑设计及应用教学英文课件:Lec21-Chap 08 counter_第3页
第3页 / 共20页
数字逻辑设计及应用教学英文课件:Lec21-Chap 08 counter_第4页
第4页 / 共20页
数字逻辑设计及应用教学英文课件:Lec21-Chap 08 counter_第5页
第5页 / 共20页
点击查看更多>>
资源描述

《数字逻辑设计及应用教学英文课件:Lec21-Chap 08 counter》由会员分享,可在线阅读,更多相关《数字逻辑设计及应用教学英文课件:Lec21-Chap 08 counter(20页珍藏版)》请在金锄头文库上搜索。

1、1,Digital Logic Design and ApplicationLecture #21,Counter,UESTC, Spring 2013,2,5. Decoding Binary-Counter States,The decoder outputs may contain “glitch” on state transitions where two or more counter bits change. function hazard,3,Decoder Waveforms,The decoder outputs may contain “glitch” on state

2、transitions where two or more counter bits change. function hazard,4,Glitch-free outputs,Registered outputs delayed by one clock tick.,5,6. Cascading Counter (synchronous),计数范围:0 255,99,两个芯片同步工作,6,RCO=QDQCQBQA,RCO-in,1,0,Counting ,Hold ,低片计数器每计满一个周期后,高片计一个数。,7,6. Cascading Counter (asynchronous),思考:

3、利用低位的进位控制高位的时钟行不行?, 两个芯片异步工作。,8,7. Modulo-m Counter,Use SSI devices state machine design using gates and flip-flops Use MSI counter realize a modulo-m counter using an n-bit binary counter Consider two cases m 2n, Using clear or load inputs, Cascading Counter (a)synchronous),9,Design a modulo-11 cou

4、nter using a 74x163, m2n,Clear after Count = (1010)B= (10)D 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,CLR_L asserted,Note : modulo-11 Clear after Count = (10)D,0, 1, 2, 3, 10,10,Quiz:如果是74x161 (异步清零) 可以这样连接吗?,利用1011状态异步清零,会出现“毛刺”,Design a modulo-11 counter using a 74x163, m2n,Clear after Count = (1010)B= (10

5、)D 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, ,0 1 0 1,不可,1010状态将会以“毛刺”形态出现,造成少计一个数的行为。,1 1 0,74X161,11,Design a modulo-11 counter using a 74x163,Load 5 (0101)2 after Count = 15 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, m2n,LD_L asserted, 5, 6, 15,12,Design a modulo-11 counter using a 74x163,Load 01

6、01 (5) after Count = 15 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 5, 6, , m2n,1 0 1 0,清零法需要额外设计进位输出端,置数法不需要 Quiz: use states 313 to build a modulo-11 counter?,13,Using a 74x163 as a excess-3 counter,Counting from 3 to 12,LD_L asserted,14,1 1 0 0,Using a 74x163 as a excess-3 counter,Counting from 3 to 1

7、2,0 0 1 1,15,Q3 10, duty cycle = 50,16,Modulo-m Counter ( m2n ),Cascade, then clear or load Design a modulo-193 counter using 74x163 Cascade two 163 to obtain a 8-bit counter (0255) Clear after Count = 192 (1100 0000) Load 63 (0011 1111) after Count = 255 25619363 If m = m1m2 Realize m1 and m2 respectively, then cascade,17,6310 = ( 0011 1111 )2,18,19,Example: analysis the following circuit,QD QC QB QA 0 0 0 0 0 1 1 0 0 1 1 1 1 0 0 0 1 1 1 0 1 1 1 1,20,Exercise: analysis the following circuit,模12计数器 QD:12分频 占空比50,

展开阅读全文
相关资源
正为您匹配相似的精品文档
相关搜索

最新文档


当前位置:首页 > 高等教育 > 大学课件

电脑版 |金锄头文库版权所有
经营许可证:蜀ICP备13022795号 | 川公网安备 51140202000112号