An algorithm to deal with incremental layout alteration

C. Choy, Tsz-Shing Cheung
{"title":"An algorithm to deal with incremental layout alteration","authors":"C. Choy, Tsz-Shing Cheung","doi":"10.1109/MWSCAS.1991.252079","DOIUrl":null,"url":null,"abstract":"Incremental design alteration usually requires complete rework on the IC layout. An algorithm is proposed which tackles the problem in minimum time and creates the least perturbation to the original layout, preserving performance. The algorithm aims at automatic adjustment of layout due to minor change on logic design. As a result, the designer need not re-execute the whole placement process or manually correct the placement. Using dynamic variables to form the database, it is more efficient to implement the algorithm. Results and computation time of the algorithm are also found advantageous.<<ETX>>","PeriodicalId":6453,"journal":{"name":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","volume":"25 1","pages":"850-853 vol.2"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the 34th Midwest Symposium on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.1991.252079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Incremental design alteration usually requires complete rework on the IC layout. An algorithm is proposed which tackles the problem in minimum time and creates the least perturbation to the original layout, preserving performance. The algorithm aims at automatic adjustment of layout due to minor change on logic design. As a result, the designer need not re-execute the whole placement process or manually correct the placement. Using dynamic variables to form the database, it is more efficient to implement the algorithm. Results and computation time of the algorithm are also found advantageous.<>
一种处理增量布局变更的算法
增量设计变更通常需要对IC布局进行完全的返工。提出了一种算法,在最短的时间内解决问题,对原有布局产生最小的扰动,保持性能。该算法的目标是在逻辑设计发生微小变化时自动调整布局。因此,设计师不需要重新执行整个放置过程或手动纠正放置。采用动态变量组成数据库,提高了算法的实现效率。结果表明,该算法在计算时间和结果上都具有优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信