
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K.T. Cheng, V.D. Agrawal, "Initializability Consideration in Sequential Machine Synthesis," IEEE Transactions on Computers, vol. 41, no. 3, pp. 374379, March, 1992.  
BibTex  x  
@article{ 10.1109/12.127453, author = {K.T. Cheng and V.D. Agrawal}, title = {Initializability Consideration in Sequential Machine Synthesis}, journal ={IEEE Transactions on Computers}, volume = {41}, number = {3}, issn = {00189340}, year = {1992}, pages = {374379}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.127453}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Initializability Consideration in Sequential Machine Synthesis IS  3 SN  00189340 SP374 EP379 EPD  374379 A1  K.T. Cheng, A1  V.D. Agrawal, PY  1992 KW  initializability; sequential machine synthesis; finitestate machine; state encoding; synchronizing sequences; state assignment; logic optimization; gatelevel analysis tools.; logic minimality; encoding; finite automata; logic design; logic testing; synchronisation. VL  41 JA  IEEE Transactions on Computers ER   
It is shown that a finitestate 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 gatelevel analysis tools. The conditions for initializability of finitestate 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.
[1] G. De Micheliet al., "Optimal state assignment for finite state machines,"IEEE Trans. Comput.Aided Design, vol. CAD4, pp. 269285, July 1985.
[2] S. Devadaset al., "MUSTANG: State assignment of finite state machines targeting multilevel logic implementations,"IEEE Trans. ComputAided Design, vol. CAD7, pp. 12901300, Dec. 1988.
[3] R. Brayton, G. Hachtel, C. McMullen, and A. SangioVincentelli,Logic Minimization Algorithms for VLSI Synthesis. Boston, MA: Kluwer Academic, 1984.
[4] R. Braytonet al., "MIS: A multiple level logic optimization system,"IEEE Trans. Comput.Aided Design, vol. CAD6, pp. 10621081, Nov. 1987.
[5] K. Keutzer, "DAGON: Technology binding and local optimization by DAG matching," inProc. 24th Design Automat. Conf., June 1987, pp. 341347.
[6] V. D. Agrawal, K. T. Cheng, and P. Agrawal, "A directed search method for test generation using a concurrent fault simulator,"IEEE Trans. Comput.Aided Design, vol. CAD8, pp. 131138, Feb. 1989.
[7] S. Mallela and S. Wu, "A sequential circuit test generation system," inProc. Inc. Test Conf., Philadelphia, PA, Nov. 1985, pp. 5761.
[8] K. T. Cheng and V. D. Agrawal, "Concurrent test generation and design for testability," inProc. ISCAS, Portland, OR, May 1989, pp. 19351938.
[9] G. Hachtel, R. Jacoby, K. Keutzer, and C. Morrison, "On properties of algebraic transformations and the multifault testability of multilevel logic," inProc. Int. Conf. Comput.Aided Design, Santa Clara, CA, Nov. 1989, pp. 422425.
[10] K. Keutzer, private communication.
[11] Z. Kohavi,Switching and Finite Automata Theory, second edition. New York: McGrawHill, 1978.
[12] A. Miczo,Digital Logic Testing and Simulation. New York: Harper and Row, 1986.
[13] T. Villa and A. L. SangiovanniVincentelli, "NOVA: State assignment of finite state machines for optimal twolevel logic implementations," inProc. 26th Design Automat. Conf., June 1989, pp. 327332.
[14] R. Lisanke, "Finitestate machine benchmark set,"Preliminary Benchmark Collection, Sept. 1987.