The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1992 vol.41)
pp: 374-379
ABSTRACT
<p>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. 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.</p>
INDEX TERMS
initializability; sequential machine synthesis; finite-state machine; state encoding; synchronizing sequences; state assignment; logic optimization; gate-level analysis tools.; logic minimality; encoding; finite automata; logic design; logic testing; synchronisation.
CITATION
K.-T. Cheng, V.D. Agrawal, "Initializability Consideration in Sequential Machine Synthesis", IEEE Transactions on Computers, vol.41, no. 3, pp. 374-379, March 1992, doi:10.1109/12.127453
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool