Espresso-HF:用于两级逻辑的启发式无危险最小化器

33rd Design Automation Conference Proceedings, 1996 Pub Date : 1996-06-01 DOI:10.1109/DAC.1996.545549

Michael Theobald, S. Nowick, Tao Wu

{"title":"Espresso-HF:用于两级逻辑的启发式无危险最小化器","authors":"Michael Theobald, S. Nowick, Tao Wu","doi":"10.1109/DAC.1996.545549","DOIUrl":null,"url":null,"abstract":"We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves several problems which have not been previously solved using existing exact minimizers. We believe this is the first heuristic method based on Espresso to solve the general hazard-free two-level minimization problem, for multiple-input change transitions.","PeriodicalId":152966,"journal":{"name":"33rd Design Automation Conference Proceedings, 1996","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Espresso-HF: a heuristic hazard-free minimizer for two-level logic\",\"authors\":\"Michael Theobald, S. Nowick, Tao Wu\",\"doi\":\"10.1109/DAC.1996.545549\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves several problems which have not been previously solved using existing exact minimizers. We believe this is the first heuristic method based on Espresso to solve the general hazard-free two-level minimization problem, for multiple-input change transitions.\",\"PeriodicalId\":152966,\"journal\":{\"name\":\"33rd Design Automation Conference Proceedings, 1996\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"33rd Design Automation Conference Proceedings, 1996\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1996.545549\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"33rd Design Automation Conference Proceedings, 1996","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1996.545549","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 31

摘要

提出了一种新的两级逻辑无害化启发式算法。在几乎所有的例子中，算法都能精确地找到最小代价覆盖。它还解决了以前使用现有的精确最小化器没有解决的几个问题。我们认为这是第一个基于Espresso的启发式方法，用于解决多输入变化转换的一般无危害两级最小化问题。

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

查看原文本刊更多论文

Espresso-HF: a heuristic hazard-free minimizer for two-level logic

We present a new heuristic algorithm for hazard-free minimization of two-level logic. On nearly all examples, the algorithm finds an exactly minimum-cost cover. It also solves several problems which have not been previously solved using existing exact minimizers. We believe this is the first heuristic method based on Espresso to solve the general hazard-free two-level minimization problem, for multiple-input change transitions.

求助全文

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

来源期刊

33rd Design Automation Conference Proceedings, 1996

自引率

0.00%

发文量