Title :
An efficient divide and conquer algorithm for exact hazard free logic minimization
Author :
Rutten, J.W.J.M. ; Berkelaar, M.R.C.M. ; van Eijk, C.A.J. ; Kolste, M. A J
Author_Institution :
Inf. & Commun. Syst. Group, Eindhoven Univ. of Technol., Netherlands
Abstract :
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 and Nowick (1992), 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 and 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
Keywords :
asynchronous circuits; combinational circuits; divide and conquer methods; hazards and race conditions; logic CAD; minimisation of switching nets; asynchronous design; divide/conquer algorithm; hazard free logic minimization; heuristic algorithms; Algorithm design and analysis; Communications technology; Delay; Filters; Hazards; Heuristic algorithms; Input variables; Logic design; Minimization methods; Wire;
Conference_Titel :
Design, Automation and Test in Europe, 1998., Proceedings
Conference_Location :
Paris
Print_ISBN :
0-8186-8359-7
DOI :
10.1109/DATE.1998.655942
