{"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.<>