18,400 research outputs found
Estimators for Logic Minimization and Implementation Selection of Finite State machines
This paper considers two estimation problems which occur during the implementation design for a finite state machine (FSM). The first is a precise estimation of the reduction of a programmed logic array implementation (PLA) for a FSM by logic minimization. The second concerns selection of implementation alternatives based on such estimations. Estimations give the designer a quick overview of the impact of an optimization method for FSM implementation without running the actual time-consuming algorithms. The method uses curve-fitting on results found in literature for logic minimization preceded by state-assignment. Our estimations correlate by 0.97 to those results. State-graph statistics can also be used for selection of the most profitable optimization from a set of alternatives. We tested selection between a counter based implementation, partial state coding, state-assignment and topological partitioning. The goal is selection of the alternative which has the highest probability to deliver the largest minimization of the FSM. This selection method is also empirically verified by comparing its results with results obtained by running specific optimization algorithms on machines of the MCNC benchmark set
MINIMALIST: An Environment for the Synthesis, Verification and Testability of Burst-Mode Asynchronous Machines
MINIMALIST is a new extensible environment for the synthesis and verification of burst-mode asynchronous finite-state machines. MINIMALIST embodies a complete technology-independent synthesis path, with state-of-the-art exact and heuristic asynchronous synthesis algorithms, e.g.optimal state assignment (CHASM), two-level hazard-free logic minimization (HFMIN, ESPRESSO-HF, and IMPYMIN), and synthesis-for-testability. Unlike other asynchronous synthesis packages, MINIMALIST also offers many options:literal vs. product optimization, single- vs. multi-output logic minimization, using vs. not using fed-back outputs as state variables, and exploring varied code lengths during state assignment, thus allowing the designer to explore trade-offs and select the implementation style which best suits the application. MINIMALIST benchmark results demonstrate its ability to produce implementations with an average of 34% and up to 48% less area, and an average of 11% and up to 37% better performance, than the best existing package. Our synthesis-for-testability method guarantees 100% testability under both stuck-at and robust path delay fault models,requiring little or no overhead. MINIMALIST also features both command-line and graphic user interfaces, and supports extension via well-defined interfaces for adding new tools. As such, it is easily augmented to form a complete path to technology-dependent logic
Finite State Machines With Input Multiplexing: A Performance Study
Finite state machines with input multiplexing (FSMIMs)
have been proposed in previous works as a technique for efficient
mapping FSMs into ROM memory. In this paper, we propose a new
architecture for implementing FSMIMs, called FSMIM with state-based
input selection, whose goal is to achieve a further reduction in memory
usage. This paper also describes in detail the algorithms for generating
FSMIMs used by the tool FSMIM-Gen, which has been developed
and made available on the Internet for free public use. A comparative
study in terms of speed and area between FSMIM approaches
and other field programmable gate array-based techniques is presented.
The results show that the FSMIM approaches obtain huge
reductions in the look-up table (LUT) usage by using a small number
of embedded memory blocks. In addition, speed improvements
over conventional LUT-based implementations have been obtained in
many cases
Efficient state reduction methods for PLA-based sequential circuits
Experiences with heuristics for the state reduction of finite-state machines are presented and two new heuristic algorithms described in detail. Results on machines from the literature and from the MCNC benchmark set are shown. The area of the PLA implementation of the combinational component and the design time are used as figures of merit. The comparison of such parameters, when the state reduction step is included in the design process and when it is not, suggests that fast state-reduction heuristics should be implemented within FSM automatic synthesis systems
Recommended from our members
Silicon compilation
Silicon compilation is a term used for many different purposes. In this paper we define silicon compilation as a mapping from some higher level description into layout. We define the basic issues in structural and behavioral silicon compilation and some possible solutions to those issues. Finally, we define the concept of an intelligent silicon compiler in which the compiler evaluates the quality of the generated design and attempts to improve it if it is not satisfactory
Minimum maximum reconfiguration cost problem
This paper discusses the problem of minimizing the reconfiguration cost of
some types of reconfigurable systems. A formal definition of the problem and a proof
of its NP-completeness are provided. In addition, an Integer Linear Programming
formulation is proposed. The proposed problem has been used for optimizing a design
stage of Finite Virtual State Machines
- …