宏单元放置的路由空间估计和安全分配

Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair Pub Date : 1995-08-29 DOI:10.1109/ASPDAC.1995.486413

Jin-Tai Yan

{"title":"宏单元放置的路由空间估计和安全分配","authors":"Jin-Tai Yan","doi":"10.1109/ASPDAC.1995.486413","DOIUrl":null,"url":null,"abstract":"In this paper, a unified probabilistic-based estimation is firstly proposed for different kinds of channels. Furthermore, based on the estimation of channels, one safe routing space assignment is proposed to obtain a complete macro cell placement, and the time complexities of the safe routing space assignment is analyzed to be O(NlogN), where N is the number of macro cells in a macro cell placement. Finally, the experimental results show that the proposed approach has better accuracy for the assignment of routing space.","PeriodicalId":119232,"journal":{"name":"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Routing space estimation and safe assignment for macro cell placement\",\"authors\":\"Jin-Tai Yan\",\"doi\":\"10.1109/ASPDAC.1995.486413\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a unified probabilistic-based estimation is firstly proposed for different kinds of channels. Furthermore, based on the estimation of channels, one safe routing space assignment is proposed to obtain a complete macro cell placement, and the time complexities of the safe routing space assignment is analyzed to be O(NlogN), where N is the number of macro cells in a macro cell placement. Finally, the experimental results show that the proposed approach has better accuracy for the assignment of routing space.\",\"PeriodicalId\":119232,\"journal\":{\"name\":\"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ASPDAC.1995.486413\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASPDAC.1995.486413","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文首先针对不同类型的信道，提出了一种基于概率的统一估计方法。在信道估计的基础上，提出了一种安全路由空间分配方法来获得完整的宏单元布局，并分析了安全路由空间分配的时间复杂度为O(NlogN)，其中N为宏单元布局中的宏单元个数。实验结果表明，该方法具有较高的路由空间分配精度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Routing space estimation and safe assignment for macro cell placement

In this paper, a unified probabilistic-based estimation is firstly proposed for different kinds of channels. Furthermore, based on the estimation of channels, one safe routing space assignment is proposed to obtain a complete macro cell placement, and the time complexities of the safe routing space assignment is analyzed to be O(NlogN), where N is the number of macro cells in a macro cell placement. Finally, the experimental results show that the proposed approach has better accuracy for the assignment of routing space.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair

自引率

0.00%

发文量