VLSI分层布局的力切结合算法

19th Design Automation Conference Pub Date : 1900-01-01 DOI:10.1145/800263.809274

G. J. Wipfler, M. Wiesel, D. Mlynski

{"title":"VLSI分层布局的力切结合算法","authors":"G. J. Wipfler, M. Wiesel, D. Mlynski","doi":"10.1145/800263.809274","DOIUrl":null,"url":null,"abstract":"This paper presents a new algorithm for the initial placement of hierarchical VLSI circuits. The components to be placed are orthogonal macrocells of variable shape and size. This algorithm combines the advantages of force directed placement and min-cut algorithm. It provides an initial placement which avoids overlapping between cells and includes an estimation of routing area. This algorithm is suitable for regular cell arrangements, too.","PeriodicalId":290739,"journal":{"name":"19th Design Automation Conference","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"63","resultStr":"{\"title\":\"A Combined Force and Cut Algorithm for Hierarchical VLSI Layout\",\"authors\":\"G. J. Wipfler, M. Wiesel, D. Mlynski\",\"doi\":\"10.1145/800263.809274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new algorithm for the initial placement of hierarchical VLSI circuits. The components to be placed are orthogonal macrocells of variable shape and size. This algorithm combines the advantages of force directed placement and min-cut algorithm. It provides an initial placement which avoids overlapping between cells and includes an estimation of routing area. This algorithm is suitable for regular cell arrangements, too.\",\"PeriodicalId\":290739,\"journal\":{\"name\":\"19th Design Automation Conference\",\"volume\":\"140 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"63\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"19th Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800263.809274\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800263.809274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 63

摘要

本文提出了一种分层VLSI电路初始布置的新算法。要放置的组件是形状和大小不同的正交大细胞。该算法结合了力定向定位和最小切割算法的优点。它提供了避免单元之间重叠的初始放置，并包括路由面积的估计。该算法也适用于有规则的单元排列。

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

查看原文本刊更多论文

A Combined Force and Cut Algorithm for Hierarchical VLSI Layout

This paper presents a new algorithm for the initial placement of hierarchical VLSI circuits. The components to be placed are orthogonal macrocells of variable shape and size. This algorithm combines the advantages of force directed placement and min-cut algorithm. It provides an initial placement which avoids overlapping between cells and includes an estimation of routing area. This algorithm is suitable for regular cell arrangements, too.

求助全文

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

来源期刊

19th Design Automation Conference

自引率

0.00%

发文量