A CAD Tool for the Optimal State Assignment of Sequential Synchronous Circuits
نویسندگان
چکیده
Assigning proper binary codes to the states of sequential circuits is a long studied problem known as state assignment. The choice of the numbers assigned to the states determines the final hardware structure and implementation requirements of the circuits. Conventional state assignment techniques can not be applied when arbitrary optimality criteria are defined. The problem can actually be seen as a search problem with a huge non-linear space. The nature of the space makes it impossible to find optimal solutions by conducting exhaustive, random or conventional search techniques. In this paper, a CAD tool is introduced which solves the problem for sequential synchronous circuits by means of a Genetic Algorithm (GA). The main advantage of the tool is the ability to cope with large circuits and optimize with respect to different objective functions. Moreover, it is free, easy-to-use and crossplatform.
منابع مشابه
An efficient algorithm for constrained encoding and its applications
Abstracr-In this paper, an efficient algorithm and its implementation ENCORE are presented for finding approximate solutions to dichotomy-based constrained encoding, a problem fundamental to the synthesis of combinational logic circuits, and synchronous and asynchronous sequential circuits. ENCORE adopts a greedy strategy to find an encoding bit by bit, and then uses an iterative method to impr...
متن کاملMUSTANG: state assignment of finite state machines targeting multilevel logic implementations
In this paper, we address the problem of the state assignment for synchronous finite state machines (FSM), targeted towards multilevel combinational logic and feedback register implementations. Optimal state assignment aims at a minimum area implementation. All previous work in automatic FSM state assignment has been directed at programmable logic array (PLA) i.e., two-level logic implementatio...
متن کاملIrredundant sequential machines via optimal logic synthesis
optimal sequential logic synthesis can produce fallv testable nonscan finite state machines. Test generation algorithms can be used It is well known that optimal logic synthesis can ensure fully to remove all the redundancies in sequential machines resulting in testable combinational logic designs. In this paper. we show that fuily testable designs. However. in general. this method requires opt...
متن کاملPROPTEST: a property-based test generator for synchronous sequential circuits
We describe a property-based test generation procedure for synchronous sequential circuits. Several techniques are used to generate test sequences that achieve high fault coverages at low computational complexity. These include the use of static test compaction, input vector holding with optimal numbers of hold cycles, input vector perturbation, and identification of subsequences that are usefu...
متن کاملTwo-Criterion Optimization in State Assignment for Synchronous Finite State Machines using NSGA-II
One of the challenging problems in circuit implementations is finding the best state assignment for implementing a synchronous sequential circuit which are also represented as Finite State Machines. This problem, commonly known as State Assignment Problem (S.A.P.), has been studied extensively because of its importance in reducing the cost of implementation of circuits. The previous work on thi...
متن کامل