首页> 外文会议>Desing, Automation and Test in Europe Conference and Exhibition >Verifying clock schedules in the presence of cross talk
【24h】

Verifying clock schedules in the presence of cross talk

机译:在跨谈的存在下验证时钟时间表

获取原文

摘要

This paper addresses verifying the timing of circuits containing level-sensitive latches in the presence of cross talk. We show that three consecutive periodic occurrences of the aggressor's input switching window must be compared with the victim's input switching window We propose a new phase shift operator to allow aligning the aggressor's three relevant switching windows with the victim's input signals. We solve the problem iteratively in polynomial time, and show an upper bound on the number of iterations equal to the number of capacitors in the circuit. Our experiments demonstrate that eliminating false coupling results in finding a smaller clock period at which a circuit will run.
机译:本文在存在交叉谈话中验证包含电路敏感锁存器的电路定时。我们表明,必须将侵略性的输入切换窗口的三个连续定期出现与受害者的输入切换窗口进行比较,我们提出了一种新的相移运算符,以允许将攻击者的三个相关的开关窗口与受害者的输入信号对齐。我们在多项式时间中迭代地解决问题,并且在电路中的电容器数量等于电容器的数量上显示上限。我们的实验表明,消除错误耦合导致找到电路运行的较小时钟周期。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号