An adaptive algorithm for computing the initial states of retimed circuits

Retiming is an important technique to minimize the delay and/or area by relocating registers in sequential circuits. In this paper, we formulate a new problem for initial state computation for a set of retimed circuits having the same corresponding finite state machine, and propose a new adaptive algorithm to solve it. The retimed circuit discussed in this paper can be any circuit with forward and/or backward retiming or even with circuit replication. The proposed new adaptive algorithm based on homing sequence technique can effectively compute an equivalent state of the retimed circuit whenever the initial state of the original circuit can be reached from some final states corresponding to some homing sequences of the corresponding finite state machine. It is also applicable to sequential circuits with partial initial state assignments by allowing that some values of registers are not specified.

[1]  Leon Stok,et al.  Retiming revisited and reversed , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Marios C. Papaefthymiou,et al.  TIM: A Timing Package for Two-Phase, Level-Clocked Circuitry , 1993, 30th ACM/IEEE Design Automation Conference.

[3]  Sheldon B. Akers,et al.  Universal Test Sets for Logic Networks , 1972, IEEE Transactions on Computers.

[4]  S. Sapatnekar,et al.  Minimum area retiming with equivalent initial states , 1997, ICCAD 1997.

[5]  Janusz Rajski,et al.  Behavior and testability preservation under the retiming transformation , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[7]  Guy Even.  The Retiming Lemma: A simple proof and applications , 1996, Integr..

[8]  Robert K. Brayton,et al.  The Validity of Retiming Sequential Circuits , 1995, 32nd Design Automation Conference.

[9]  Narendra V. Shenoy,et al.  Retiming: Theory and practice , 1997, Integr..

[10]  Robert K. Brayton,et al.  Retiming and resynthesis: optimizing sequential networks with combinational techniques , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Jason Cong,et al.  Optimal FPGA mapping and retiming with efficient initial state computation , 1998, DAC.

[12]  Robert K. Brayton,et al.  Sequential circuit design using synthesis and optimization , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[13]  Robert K. Brayton,et al.  The case for retiming with explicit reset circuitry , 1996, ICCAD 1996.

[14]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Leon Stok,et al.  Improving initialization through reversed retiming , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[16]  Robert K. Brayton,et al.  SIS : A System for Sequential Circuit Synthesis Electronics Research Laboratory Memorandum , 1992 .

[17]  Robert K. Brayton,et al.  Computing the initial states of retimed circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Leendert M. Huisman,et al.  A small test generator for large designs , 1992, Proceedings International Test Conference 1992.