| 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, 1998. |
....previously could not be solved exactly in number of literals. The state of the art in literal exact two level hazard free logic minimization is HFMIN [4] However, this tool requires thousands of seconds for large controllers, and does not complete for the largest benchmarks. The tool IMPYMIN [21], which is based on implicit algorithms, performs substantially better but is only capable of producing cube exact solutions. The most time efficient tool to date is ESPRESSO HF [21] but it uses heuristic algorithms and thus cannot guarantee either literal or cube exact solutions. These ....
....thousands of seconds for large controllers, and does not complete for the largest benchmarks. The tool IMPYMIN [21] which is based on implicit algorithms, performs substantially better but is only capable of producing cube exact solutions. The most time efficient tool to date is ESPRESSO HF [21], but it uses heuristic algorithms and thus cannot guarantee either literal or cube exact solutions. These minimizers are currently used to perform logic minimization in the 3D [22] and MINIMALIST [5] burst mode synthesis tools. The approach taken in this paper exploits standard synthesis ....
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.
.... RTL statements in the CDFG, communication channels connect functional unit controllers (which may implement more than one RTL statement) Each functional unit controller is formally extracted from the CDFG (step 2) and can be synthesized using extended burst mode finite state machines (AFSM) [19, 25, 11, 10, 23]. Burst mode is a commonly used approach to designing Mealy like asynchronous controllers. This step will be explained in detail below (Section 4) Each constraint (arc) is translated into a single wire (channel) Each CDFG node (e.g. RTL statement) is translated into a series of microoperations ....
....Extraction After the global transformations have been applied, an asynchronous finite state machine (AFSM) is extracted for each functional unit controller. The extraction algorithm is a direct deterministic translation from the CDFG (see Figure 6) into asynchronous Burst Mode Controllers [19, 25, 11, 10, 23]. 4.1 Background on Burst Mode FSMs In a Burst Mode AFSM, state transitions occur when a specified input burst (set of variables before the ) has been received. A fragment of a BM AFSM is shown in Figure 11. During the transition to the next state, the corresponding output burst (set of ....
M. Theobald and S. M. Nowick. Fast heuristic and exact algorithms for two-level hazard-free logic minimization. IEEE Trans. on Computer-Aided Design,Nov. 1998.
No context found.
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, 1998.
No context found.
M. Theobald and S.M. Nowick. Fast heuristic and exact algorithms for two-level hazard-free logic minimization, IEEE Transactions on CAD, vol. 17:11, pp. 1130-1147, Nov. 1998. Proceedings of the International Symposium on Quality Electronic Design (ISQED02)
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