- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
* * * 2 Phase, with multiple conditional buffered clocks 2.8 nF clock load 40 cm final driver width Local clocks can be gated “off” to save power Reduced load/skew Reduced thermal issues Multiple clocks complicate race checking trise = 0.35ns tskew = 50ps tcycle= 1.67ns EV6 (Alpha 21264) Clocking 600 MHz – 0.35 micron CMOS Global clock waveform * * * Two Phase Handshake * EE141 * EE141 * * * D Clk Q D Q Clk tc-q thold PWm tsu td-q Delays can be different for rising and falling data transitions T * D Clk Q D Q Clk tc-q thold T tsu Delays can be different for rising and falling data transitions * Sources of clock uncertainty * Clock skew Spatial variation in temporally equivalent clock edges; deterministic + random, tSK Clock jitter Temporal variations in consecutive edges of the clock signal; modulation + random noise Cycle-to-cycle (short-term) tJS Long term tJL Variation of the pulse width Important for level sensitive clocking * Both skew and jitter affect the effective cycle time Only skew affects the race margin Clk Clk tSK tJS * * Launching edge arrives before the receiving edge * Receiving edge arrives before the launching edge * Minimum cycle time: T - ? = tc-q + tsu + tlogic Worst case is when receiving edge arrives early (positive ?) * Hold time constraint: t(c-q, cd) + t(logic, cd) thold + ? Worst case is when receiving edge arrives lateRace between data and clock * * Clk T TSU TClk-Q TLM Latest point of launching Earliest arrivalof next cycle TJI + d * If launching edge is late and receiving edge is early, the data will not be too late if: Minimum cycle time is determined by the maximum delays through the logic Tc-q + TLM + TSU T – TJI,1 – TJI,2 - d Tc-q + TLM + TSU + d + 2 TJI T Skew can be either positive or negative * Clk TClk-Q TLm Earliest point of launching Data must not arrivebefore this time Clk TH Nominalclock edge * Minimum logic delay If launching edge is early and receiving edge is late: Tc-q + TLM – TJI,1 TH + TJI,2 + d Tc-q + TLM
您可能关注的文档
- Unit-6-I'm-watching-TV-SectionB--公开课一等奖课件.ppt
- let's-spell语音教学四年级英语.ppt
- LGJ-50导线钳压方法.ppt
- LIFI简介-新一代无线通信.ppt
- unit6被动与主动-英汉对比与翻译.ppt
- Unit-7--Is-this-an-orange-湘少版小学英语课件.ppt
- LNG槽车培训分解.ppt
- Unit-7-Will-People-Have-Robots-Section-B-(2a-2e)说课比赛课件.pptx
- logo语言-重复命令(画正多边形、多角星).ppt
- Unit-8-Days-of-the-week-四年级英语-下册.ppt
原创力文档


文档评论(0)