Michael Theobald, Steven M. Nowick  Home/Search
Context Related
| columbia.edu/~nowi...altcad98paper.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: usc.edu/~tugsinav/readls...readls (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and automated circuit partitioning techniques. This paper introduces two new 2-level hazard-free logic minimizers: Espresso-HF, a heuristic method which is loosely based on Espresso-II, and Impymin, an exact method based on implicit data structures. Both minimizers can solve all currently-available examples, which range up... (Update)
Similar documents based on text: More All
2.8: Fast Heuristic and Exact Algorithms for Two-Level.. - Michael Theobald And (1998) (Correct)
0.9: Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level .. - Theobald, Nowick, Wu (Correct)
0.6: Exact Two-Level Minimization of Hazard-Free Logic with.. - Nowick, Dill (1992) (Correct)
BibTeX entry: (Update)
M. Theobald and S. M. Nowick. Fast heuristic and exact algorithms for two-level hazard-free logic minimization. IEEE Transactions on Computer-Aided Design, 17(11):1130--1147, Nov. 1998. http://citeseer.ist.psu.edu/article/theobald98fast.html More
@article{ theobald98fast,
author = "Michael Theobald and Steven M. Nowick",
title = "Fast Heuristic and Exact Algorithms for Two-Level Hazard-Free Logic Minimization",
journal = "IEEE Transactions on Computer-Aided Design",
volume = "17",
number = "11",
pages = "1130--1147",
year = "1998",
url = "citeseer.ist.psu.edu/article/theobald98fast.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986
296 Logic Minimization Algorithms for VLSI Synthesis (context) - Brayton - 1984
99 Asynchronous Sequential Switching Circuits (context) - Unger - 1969
80 Zero-Suppressed BDDs for set manipulation in combinatorial p.. (context) - Minato - 1993
80 The design of an asynchronous microprocessor (context) - Martin, Burns et al. - 1989
79 Algorithms for Synthesis and Testing of Asynchronous Circuit.. (context) - Lavagno, Sangiovanni-Vincentelli - 1993
75 Multiple valued minimization for PLA optimization (context) - Rudell, Vincentelli - 1987
74 Petrify: a tool for manipulating concurrent specifications a.. - Cortadella, Kishinevsky et al. - 1997
52 Concurrent Hardware: The Theory and Practice of Self-Timed D.. (context) - Kishinevsky, Kondratyev et al. - 1994
46 Exact two-level minimization of hazard-free logic with multi.. - Nowick, Dill - 1995
39 Two-level logic minimization: an overview (context) - Coudert - 1994
37 The counterflow pipeline processor architecture - Sproull, Sutherland et al. - 1994
34 Synthesis of asynchronous state machines using a local clock (context) - Nowick, Dill - 1991
27 Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic S.. (context) - Chu - 1987
22 The design and verification of a high-performance low-contro.. - Yun, Dooply et al. - 1997
[Article contains additional citations not shown here]
Documents on the same site (http://www-scf.usc.edu/~tugsinav/readls/readls.html): More
Exact Two-Level Minimization of Hazard-Free Logic with.. - Nowick, Dill (1992) (Correct)
Synthesis of Asynchronous Circuits for Stuck-at and Robust.. - Nowick, Jha, Cheng (1995) (Correct)
OPTIMISTA: State Minimization of Asynchronous FSMs for.. - Fuhrer, Nowick (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC