T. Shinsha, T. Kubo, M. Hikosaka, K. Akiyama, K. Ishihara
{"title":"POLARIS:组合逻辑合成的极性传播算法","authors":"T. Shinsha, T. Kubo, M. Hikosaka, K. Akiyama, K. Ishihara","doi":"10.1109/DAC.1984.1585814","DOIUrl":null,"url":null,"abstract":"A new algorithm for combinational logic synthesis, POLARIS, is described. POLARIS automatically generates optimized gate level logic from functional level specification described by Boolean expressions. It transforms the Boolean expressions into logical operator trees, and produces a network of physical units or units of physical design by introducing polarity and propagating it along the tree. Experimental results show that more than 96% of gate level logic structures are equal to the logic structures designed by experts.","PeriodicalId":188431,"journal":{"name":"21st Design Automation Conference Proceedings","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"POLARIS: Polarity Propagation Algorithm for Combinational Logic Synthesis\",\"authors\":\"T. Shinsha, T. Kubo, M. Hikosaka, K. Akiyama, K. Ishihara\",\"doi\":\"10.1109/DAC.1984.1585814\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new algorithm for combinational logic synthesis, POLARIS, is described. POLARIS automatically generates optimized gate level logic from functional level specification described by Boolean expressions. It transforms the Boolean expressions into logical operator trees, and produces a network of physical units or units of physical design by introducing polarity and propagating it along the tree. Experimental results show that more than 96% of gate level logic structures are equal to the logic structures designed by experts.\",\"PeriodicalId\":188431,\"journal\":{\"name\":\"21st Design Automation Conference Proceedings\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st Design Automation Conference Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1984.1585814\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st Design Automation Conference Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1984.1585814","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
POLARIS: Polarity Propagation Algorithm for Combinational Logic Synthesis
A new algorithm for combinational logic synthesis, POLARIS, is described. POLARIS automatically generates optimized gate level logic from functional level specification described by Boolean expressions. It transforms the Boolean expressions into logical operator trees, and produces a network of physical units or units of physical design by introducing polarity and propagating it along the tree. Experimental results show that more than 96% of gate level logic structures are equal to the logic structures designed by experts.