loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design Automation and Test in Europe (DATE '98)
An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization
Paris, France
February 23-February 26
ISBN: 0-8186-8359-7
ASCII Text
x 
 
J.W.J.M. Rutten, M.R.C.M. Berkelaar, C.A.J. Van Eijk, M.A.J. Kolsteren, "An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization," Design, Automation and Test in Europe Conference and Exhibition, pp. 749, Design Automation and Test in Europe (DATE '98), 1998.
 
 
BibTex
x
 
@article{ 10.1109/DATE.1998.655942,
author = {J.W.J.M. Rutten and M.R.C.M. Berkelaar and C.A.J. Van Eijk and M.A.J. Kolsteren},
title = {An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization},
journal ={Design, Automation and Test in Europe Conference and Exhibition},
volume = {0},
year = {1998},
isbn = {0-8186-8359-7},
pages = {749},
doi = {http://doi.ieeecomputersociety.org/10.1109/DATE.1998.655942},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Design, Automation and Test in Europe Conference and Exhibition
TI - An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization
SN - 0-8186-8359-7
SP
EP
A1 - J.W.J.M. Rutten,
A1 - M.R.C.M. Berkelaar,
A1 - C.A.J. Van Eijk,
A1 - M.A.J. Kolsteren,
PY - 1998
KW - asynchronous logic
KW - divide and conquer
KW - exact minimization
KW - two-level minimization
KW - hazard free logic
VL - 0
JA - Design, Automation and Test in Europe Conference and Exhibition
ER -
 
J.W.J.M. Rutten, Eindhoven University of Technology
M.R.C.M. Berkelaar, Eindhoven University of Technology
C.A.J. Van Eijk, Eindhoven University of Technology
M.A.J. Kolsteren, Eindhoven University of Technology
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.
Index Terms:
asynchronous logic, divide and conquer, exact minimization, two-level minimization, hazard free logic
Citation:
J.W.J.M. Rutten, M.R.C.M. Berkelaar, C.A.J. Van Eijk, M.A.J. Kolsteren, "An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization," date, pp.749, Design Automation and Test in Europe (DATE '98), 1998
Usage of this product signifies your acceptance of the Terms of Use.