{"title":"基于花冠的电路划分和再合成","authors":"S. Dey, F. Brglez, G. Kedem","doi":"10.1109/DAC.1990.114926","DOIUrl":null,"url":null,"abstract":"Application of corolla-based partitioning to improve synthesis of large multi-level logic circuits is introduced. First, stem regions, petals, and corollas are defined. Next, the partitioning algorithm is outlined and the resynthesis process is described. Results of partitioning and logic resynthesis on a variety of large circuit benchmarks are summarized. It is found that logic resynthesis based on corolla partitioning consistently reduces reconvergent fanout branches, transistor pairs and layout areas, while improving circuit delay and testability.<<ETX>>","PeriodicalId":118552,"journal":{"name":"27th ACM/IEEE Design Automation Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":"{\"title\":\"Corolla based circuit partitioning and resynthesis\",\"authors\":\"S. Dey, F. Brglez, G. Kedem\",\"doi\":\"10.1109/DAC.1990.114926\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Application of corolla-based partitioning to improve synthesis of large multi-level logic circuits is introduced. First, stem regions, petals, and corollas are defined. Next, the partitioning algorithm is outlined and the resynthesis process is described. Results of partitioning and logic resynthesis on a variety of large circuit benchmarks are summarized. It is found that logic resynthesis based on corolla partitioning consistently reduces reconvergent fanout branches, transistor pairs and layout areas, while improving circuit delay and testability.<<ETX>>\",\"PeriodicalId\":118552,\"journal\":{\"name\":\"27th ACM/IEEE Design Automation Conference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"27th ACM/IEEE Design Automation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1990.114926\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"27th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1990.114926","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Corolla based circuit partitioning and resynthesis
Application of corolla-based partitioning to improve synthesis of large multi-level logic circuits is introduced. First, stem regions, petals, and corollas are defined. Next, the partitioning algorithm is outlined and the resynthesis process is described. Results of partitioning and logic resynthesis on a variety of large circuit benchmarks are summarized. It is found that logic resynthesis based on corolla partitioning consistently reduces reconvergent fanout branches, transistor pairs and layout areas, while improving circuit delay and testability.<>