{"title":"一种基于分割的宏单元定向和旋转分配方法","authors":"Jin-Tai Yan, P.-Y. Hsiao","doi":"10.1109/APCCAS.1994.514609","DOIUrl":null,"url":null,"abstract":"A unified partitioning based algorithm for the orientation and rotation assignments of macro cells is proposed to minimize total wire length in a macro cell placement. For the orientation and rotation assignments of macro cells, we transform the orientation problem and the rotation problem into a constrained graph bisection problem and a constrained graph quadrisection problem, respectively. Furthermore, a unified fuzzy graph clustering is proposed to solve the two constrained partitioning problems at the same time. The partitioning results of the constrained graph bisection and the constrained graph quadrisection will lend to the orientation and rotation assignments for a macro cell placement. As a result, the proposed partitioning based approach has tested some macro cell placements for the orientation and rotation assignments. The experimental results show that the partitioning based approach obtains better wire reductions on these tested placements.","PeriodicalId":231368,"journal":{"name":"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems","volume":"221 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A partitioning-based approach for the orientation and rotation assignments of macro cells\",\"authors\":\"Jin-Tai Yan, P.-Y. Hsiao\",\"doi\":\"10.1109/APCCAS.1994.514609\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A unified partitioning based algorithm for the orientation and rotation assignments of macro cells is proposed to minimize total wire length in a macro cell placement. For the orientation and rotation assignments of macro cells, we transform the orientation problem and the rotation problem into a constrained graph bisection problem and a constrained graph quadrisection problem, respectively. Furthermore, a unified fuzzy graph clustering is proposed to solve the two constrained partitioning problems at the same time. The partitioning results of the constrained graph bisection and the constrained graph quadrisection will lend to the orientation and rotation assignments for a macro cell placement. As a result, the proposed partitioning based approach has tested some macro cell placements for the orientation and rotation assignments. The experimental results show that the partitioning based approach obtains better wire reductions on these tested placements.\",\"PeriodicalId\":231368,\"journal\":{\"name\":\"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems\",\"volume\":\"221 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCCAS.1994.514609\",\"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 APCCAS'94 - 1994 Asia Pacific Conference on Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCCAS.1994.514609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A partitioning-based approach for the orientation and rotation assignments of macro cells
A unified partitioning based algorithm for the orientation and rotation assignments of macro cells is proposed to minimize total wire length in a macro cell placement. For the orientation and rotation assignments of macro cells, we transform the orientation problem and the rotation problem into a constrained graph bisection problem and a constrained graph quadrisection problem, respectively. Furthermore, a unified fuzzy graph clustering is proposed to solve the two constrained partitioning problems at the same time. The partitioning results of the constrained graph bisection and the constrained graph quadrisection will lend to the orientation and rotation assignments for a macro cell placement. As a result, the proposed partitioning based approach has tested some macro cell placements for the orientation and rotation assignments. The experimental results show that the partitioning based approach obtains better wire reductions on these tested placements.