Incremental retiming for FPGA physical synthesis

In this paper, the authors presented a new linear-time retiming algorithm that produces near-optimal results. The implementation is specifically targeted at Altera's Stratix FPGA-based designs, although the techniques described are general enough for any implementation medium. The algorithm is able to handle the architectural constraints of the target device, multiple timing constraints assigned by the user and implicit legality constraints. It ensures that register moves do not create asynchronous problems such as creating a glitch on a clock/reset signal.

[1]  Charles E. Leiserson,et al.  Optimizing synchronous systems , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Sachin S. Sapatnekar,et al.  Efficient retiming of large circuits , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[3]  Stephen Dean Brown,et al.  Integrated retiming and placement for field programmable gate arrays , 2002, FPGA '02.

[4]  Vaughn Betz,et al.  The stratixπ routing and logic architecture , 2003, FPGA '03.

[5]  Stephen D. Brown,et al.  Incremental placement for layout-driven optimizations on FPGAs , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[6]  Narendra V. Shenoy,et al.  Efficient implementation of retiming , 1994, ICCAD.

[7]  Klaus Eckl,et al.  A practical approach to multiple-class retiming , 1999, DAC '99.

[8]  Naresh Maheshwari,et al.  Eecient Retiming of Large Circuits , 1998 .

[9]  Charles E. Leiserson,et al.  Retiming synchronous circuitry , 1988, Algorithmica.

[10]  P. Suaris,et al.  Smart move: a placement-aware retiming and replication method for field programmable gate arrays , 2003, ASIC, 2003. Proceedings. 5th International Conference on.