David S. Kung, R. Damiano, T. A. Nix, David J. Geiger
{"title":"BDDMAP: a technology mapper based on a new covering algorithm","authors":"David S. Kung, R. Damiano, T. A. Nix, David J. Geiger","doi":"10.1109/DAC.1992.227755","DOIUrl":null,"url":null,"abstract":"The authors present a technology mapper, BDDMAP, which combines the strengths of rule-based heuristics and algorithmic techniques. Rule-based heuristics or functional matching is invoked to match the type of technology gates for which it is most efficient. The algorithmic part of BDDMAP lies in the covering process. The novel aspects of the covering algorithm are using an anticipative cost function, global cost propagation and handling of multiple output gates. The mapping problem is discussed in the context of matching of patterns and covering of the target network. The matching process is discussed followed by benchmark results.<<ETX>>","PeriodicalId":162648,"journal":{"name":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings 29th ACM/IEEE Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1992.227755","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26
Abstract
The authors present a technology mapper, BDDMAP, which combines the strengths of rule-based heuristics and algorithmic techniques. Rule-based heuristics or functional matching is invoked to match the type of technology gates for which it is most efficient. The algorithmic part of BDDMAP lies in the covering process. The novel aspects of the covering algorithm are using an anticipative cost function, global cost propagation and handling of multiple output gates. The mapping problem is discussed in the context of matching of patterns and covering of the target network. The matching process is discussed followed by benchmark results.<>