Initializability consideration in sequential machine synthesis
- 1 March 1992
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (3) , 374-379
- https://doi.org/10.1109/12.127453
Abstract
It is shown that a finite state machine, whose state encoding is obtained only to reduce the amount of logic in the final implementation, may not be initializable by a logic simulator or a test generator even when the circuit is functionally initializable (i.e., has synchronizing sequences). A fault simulator or a sequential circuit test generator, that assumes all memory elements initially to be in the unknown state, will be totally ineffective for such a design. Proper consideration for initializability during state assignment and logic optimization can guarantee the success for gate level analysis tools. In this paper, the conditions for initializability of finite state machines are derived and an automatic state assignment algorithm for logic minimality and initializability is given. Experimental results show that, in most cases, this method does not require more hardware than the other methods that may produce an uninitializable design. A partial reset technique, recommended for machines without a synchronizing sequence, is also discussed.Keywords
This publication has 9 references indexed in Scilit:
- Concurrent test generation and design for testabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On properties of algebraic transformation and the multifault testability of multilevel logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- NOVA: state assignment of finite state machines for optimal two-level logic implementationsPublished by Association for Computing Machinery (ACM) ,1989
- A directed search method for test generation using a concurrent simulatorIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- MUSTANG: state assignment of finite state machines targeting multilevel logic implementationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- DAGON: technology binding and local optimization by DAG matchingPublished by Association for Computing Machinery (ACM) ,1987
- Optimal State Assignment for Finite State MachinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984