State assignment for initializable synthesis (gate level analysis)
Kwang-Ting Tim Cheng, Vishwani D. Agrawal · 2003
Proper consideration of initializability during state assignment can guarantee success for gate level analysis tools. The necessary and sufficient conditions for initializability are derived. The new state assignment algorithm uses additional constraints for initialization by a preselected input sequence. 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 is suggested for machines without a synchronizing sequence.>