数字仿真的时间增量算法

Kiyoung Choi, Sun-Young Hwang, T. Blank
{"title":"数字仿真的时间增量算法","authors":"Kiyoung Choi, Sun-Young Hwang, T. Blank","doi":"10.1109/DAC.1988.14806","DOIUrl":null,"url":null,"abstract":"The authors present an incremental-in-time algorithm for incremental simulation of digital circuits. In contrast to the incremental-in-space algorithm, which pessimistically resimulates the circuit components that could be affected by design changes throughout the simulation time frames, the incremental-in-time algorithm resimulates a circuit component only for the simulation time frames when its inputs or internal state variable make different state transitions from the previous simulation run. It maximally utilizes the past history, thereby reducing the number of component evaluations to a minimum. Experimental results obtained for several practical circuits show speedups up to 30 times faster than conventional event-driven stimulation.<<ETX>>","PeriodicalId":230716,"journal":{"name":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"25","resultStr":"{\"title\":\"Incremental-in-time algorithm for digital simulation\",\"authors\":\"Kiyoung Choi, Sun-Young Hwang, T. Blank\",\"doi\":\"10.1109/DAC.1988.14806\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present an incremental-in-time algorithm for incremental simulation of digital circuits. In contrast to the incremental-in-space algorithm, which pessimistically resimulates the circuit components that could be affected by design changes throughout the simulation time frames, the incremental-in-time algorithm resimulates a circuit component only for the simulation time frames when its inputs or internal state variable make different state transitions from the previous simulation run. It maximally utilizes the past history, thereby reducing the number of component evaluations to a minimum. Experimental results obtained for several practical circuits show speedups up to 30 times faster than conventional event-driven stimulation.<<ETX>>\",\"PeriodicalId\":230716,\"journal\":{\"name\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"25\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1988.14806\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1988.14806","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 25

摘要

提出了一种用于数字电路增量仿真的时间增量算法。与空间增量算法(在整个仿真时间框架内悲观地重新模拟可能受到设计变化影响的电路组件)相比,时间增量算法仅在电路组件的输入或内部状态变量与之前的仿真运行发生不同的状态转换时,才在仿真时间框架内重新模拟电路组件。它最大限度地利用了过去的历史,从而将组件评估的数量减少到最小。在几个实际电路中获得的实验结果表明,其加速速度比传统的事件驱动刺激快30倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Incremental-in-time algorithm for digital simulation
The authors present an incremental-in-time algorithm for incremental simulation of digital circuits. In contrast to the incremental-in-space algorithm, which pessimistically resimulates the circuit components that could be affected by design changes throughout the simulation time frames, the incremental-in-time algorithm resimulates a circuit component only for the simulation time frames when its inputs or internal state variable make different state transitions from the previous simulation run. It maximally utilizes the past history, thereby reducing the number of component evaluations to a minimum. Experimental results obtained for several practical circuits show speedups up to 30 times faster than conventional event-driven stimulation.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic building of graphs for rectangular dualisation (IC floorplanning) Parameterized schematics (VLSI) Experience with the VHDL environment LocusRoute: a parallel global router for standard cells How to obtain more compactable channel routing solutions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1