An efficient divide and conquer algorithm for exact hazard free logic minimization

In this paper we introduce the first divide and conquer algorithm that is capable of exact hazard-free logic minimization in a constructive way. We compare our algorithm with the method of Dill/Nowick, which was the only known method for exact hazard-free minimization. We show that our algorithm is...

Full description

Saved in:
Bibliographic Details
Main Authors: Rutten, J. W. J. M., Berkelaar, M. R. C. M., van Eijk, C. A. J., Kolsteren, M. A. J.
Format: Conference Proceeding
Language:English
Subjects:
Computer systems organization > Dependable and fault-tolerant systems and networks
Computing methodologies > Artificial intelligence > Control methods
Computing methodologies > Artificial intelligence > Search methodologies
General and reference > Cross-computing tools and techniques > Performance
Hardware > Integrated circuits > Logic circuits
Hardware > Robustness
Networks > Network performance evaluation
Theory of computation > Design and analysis of algorithms > Algorithm design techniques > Dynamic programming
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we introduce the first divide and conquer algorithm that is capable of exact hazard-free logic minimization in a constructive way. We compare our algorithm with the method of Dill/Nowick, which was the only known method for exact hazard-free minimization. We show that our algorithm is much faster than the method proposed by Dill/Nowick by avoiding a significant part of the search space. We argue that the proposed algorithm is a promising framework for the development of efficient heuristic algorithms.
DOI:10.5555/368058.368394