Exact two-level minimization of hazard-free logic with multiple-input changes

Author

Nowick, Steven M. ; Dill, David L.

Author_Institution

Dept. of Comput. Sci., Columbia Univ., NY, USA

Volume

14

Issue

8

fYear

1995

fDate

8/1/1995 12:00:00 AM

Firstpage

986

Lastpage

997

Abstract

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). Overhead due to hazard elimination is shown to be negligible

Keywords

Boolean functions; asynchronous circuits; combinational circuits; logic CAD; minimisation of switching nets; asynchronous design; combinational logic; constrained Quine-McCluskey algorithm; exact two-level minimization; hazard elimination; hazard-free logic; incompletely-specified Boolean function; logic synthesis; minimum-cost sum-of-products implementation; multiple-input changes; Boolean functions; Circuit synthesis; Computer science; Delay; Design methodology; Hazards; Logic; Microwave integrated circuits; Minimization methods; System performance;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/43.402498

Filename

402498