Michael Theobald, Steven M. Nowick, Tao Wu, "Espresso-- HF: A Heuristic Hazard--Free Minimizer for Two--Level Logic", DAC'96, pp. 71--76  Home/Search   Document Details and Download   Summary   Related Articles   Check

....reduced into some smaller and simpler problems, which, by using recursion, can be solved by the same divide and conquer strategy. The recursion terminates when the problem becomes trivial. Until now, it wasunknownhow to apply a divide and conquer strategy for the generation of hazard free logic [3]. In this paper we propose an algorithm that generates all hazard free prime implicants. The generation of possible hazardous primes is prevented by keeping track of the set of required and privileged cubes. The proposed algorithm assumes a single output function. In this paper we also show how ....

M. Theobald, S.M. Nowick, T. Wu, Espresso-- HF: A Heuristic Hazard--Free Minimizer for Two--Level Logic, DAC'96, pp.71--76

....implicit prime generation and implicit set covering solving (see Section VI D for a detailed discussion) VI. EXPERIMENTAL RESULTS AND COMPARISON WITH RELATED WORK Prototype versions of our two new minimizers ESPRESSO HF 11 and IMPYMIN were run on several well known benchmark circuits [12] [37] on an UltraSPARC 140 workstation (Memory: 89 MB real 230 MB virtual) A. Comparison of Exact Minimizers: IMPYMIN Versus HFMIN The table in Fig. 9 compares our new exact minimizer IMPYMIN with the currently fastest available exact minimizer, HFMIN, by Fuhrer et al. 12] For smaller problems, ....

M. Theobald, S. M. Nowick, and T. Wu, "Espresso-HF: A heuristic hazard-free minimizer for two-level logic," in Proc. 33rd Design Automation Conf., ACM, 1996.

....[26] a SCSI controller [41] a di#erential equation solver [42] and an instruction length decoder [4] This work was supported by NSF under Grant no. MIP 9501880 and by an Alfred P. Sloan Research Fellowship. The presented work is an extended version of two recent conference papers [37], 36] Michael Theobald and Steven M. Nowick are with the Department of Computer Science, Columbia University, New York, NY 10027. Email: theobald,nowick cs.columbia.edu. An important challenge for any asynchronous synthesis method is the development of optimized CAD tools. In synchronous ....

....implicit prime generation and implicit set covering solving (see Subsection VI D for a detailed discussion) VI. Experimental Results and Comparison with Related Work Prototype versions of our two new minimizers EspressoHF 11 and Impymin were run on several well known benchmark circuits [12] [37] on an ULTRA SPARC 140 workstation (Memory: 89 MB real 230 MB virtual) A. Comparison of exact minimizers: Impymin vs. Hfmin The table in Figure 9 compares our new exact minimizer Impymin with the currently fastest available exact minimizer, Hfmin, by Fuhrer et al. 12] For smaller problems, ....

M. Theobald, S.M. Nowick, and T. Wu. Espresso-HF: A heuristic hazard-free minimizer for two-level logic. In Proceedings of the 33rd Design Automation Conference. ACM, 1996.

....[11] Finally, to ensure correct operation, two level logic minimization for burst mode asynchronous machines must also take care to avoid logic hazards. Recent developments in this area include exact multi valued input (i.e. mvi) multi output minimization [11] fast heuristic minimization [33], and exact implicit minimization [34] An additional issue facing asynchronous synthesis is the potential for using fed back outputs to reduce the number of state variables and the overall implementation complexity. In this machine implementation style, primary outputs are fed back as additional ....

....of the asynchronous tool suite at Intel Corporation, where it has been applied in the design of a high speed experimental asynchronous Instruction Length Decoder (see [5] 4. 4 ESPRESSO HF For very large problems which Hfmin is unable to solve in reasonable time, Minimalist ooeers EspressoHF [33], a new fast heuristic two level logic minimizer. Espresso HF uses an algorithm loosely based on Espresso (but substantially dioeerent from it) to solve problems with up to 32 inputs and 33 outputs. On benchmark examples, Espresso HF can nd very good covers at most 3 larger than a minimum size ....

M. Theobald and S.M. Nowick. Espresso-hf: A heuristic hazard-free minimizer for two-level logic. In DAC, June 1996.

....minimization problem by capturing hazard freedom constraints within a synchronous function by adding new variables. This work was supported by NSF under Grant no. MIP 9501880 and by an Alfred P. Sloan Research Fellowship. The presented work is an extended version of two recent conference papers [32, 31]. 1 Introduction Asynchronous design has been the focus of much recent research activity. In fact, asynchronous designs have been applied to several large scale control and datapath circuits and processors [11, 18, 12, 19, 2, 30, 34, 15, 1] A number of methods have been developed for the ....

....based on the presented new and non trivial formulation of the set of dhf prime implicants, presented in Section 4. 6 Experimental Results and Comparison with Related Work Prototype versions of our two new minimizers Espresso HF 11 and Impymin were run on several well known benchmark circuits [10, 32] on an ULTRA SPARC 140 workstation (Memory: 89 MB real 230 MB virtual) 6.1 Comparison of exact minimizers: Impymin vs. Hfmin The table in Figure 9 compares our new exact minimizer Impymin with the currently fastest available exact minimizer, Hfmin, by Robert Fuhrer et al. 10] For the smaller ....

M. Theobald, S.M. Nowick, and T. Wu. Espresso-HF: A heuristic hazard-free minimizer for twolevel logic. In Proceedings of the 33rd Design Automation Conference. ACM, 1996.

No context found.

Michael Theobald, Steven M. Nowick, Tao Wu, "Espresso-- HF: A Heuristic Hazard--Free Minimizer for Two--Level Logic", DAC'96, pp. 71--76

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