EXACT 2-LEVEL MINIMIZATION OF HAZARD-FREE LOGIC WITH MULTIPLE-INPUT CHANGES

被引：34

作者：

NOWICK, SM ^{[1
]}

DILL, DL ^{[1
]}

机构：

[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

来源：

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS | 1995年 / 14卷 / 08期

关键词：

D O I：

10.1109/43.402498

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper describes a new method for exact hazard-free logic minimization of Boolean functions, Given an incompletely-specified Boolean function, the method produces a minimum-cost sum-of-products implementation which is hazard-free for a given set of multiple-input changes, if such a solution exists, The method is a constrained version of the Quine-McCluskey algorithm, It has been automated and applied to a number of examples. Results are compared with results of a comparable non-hazard-free method (espresso-exact [33]). Overhead due to hazard elimination is shown to be negligible.

引用

页码：986 / 997

页数：12

共 38 条

[1]

AKELLA V, 1992, NOV INT C COMP AID D, P587

[2]

BEEREL P, 1992, NOV P ICAAD 92, P581

[3] UNIFIED APPROACH TO COMBINATIONAL HAZARDS [J].