Synthesis and floorplanning for large hierarchical FPGAs

Because the VLSI circuits complexity growth, the trend in design is towards divide-and-conquer schemes, in which circuits are composed of blocks, standard macros or custom macros. From the other side, to allow an implementation of large digital circuits, increased capacity target FPGAs are organized hierarchically. In this paper, we present a hierarchical FPGA floorplanning method which takes into account both the hierarchy of the design and the hierarchy of the target. The method aims at minimization the timing and balancing cost of the floorplan and is based on automatic detection of macro blocks and assigning them to the target FPGA hierarchical zones.

[1]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[2]  Ren-Song Tsay,et al.  A new method for floor planning using topological constraint reduction , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Balakrishnan Krishnamurthy,et al.  An Improved Min-Cut Algonthm for Partitioning VLSI Networks , 1984, IEEE Transactions on Computers.

[4]  Chung-Kuan Cheng,et al.  Network partitioning into tree hierarchies , 1996, DAC '96.

[5]  Chingwei Yeh,et al.  A general purpose multiple way partitioning algorithm , 1991, DAC '91.

[6]  Ting-Chi Wang,et al.  Graph-based techniques to speed up floorplan area optimization , 1993, Integr..

[7]  Eugene Shragowitz,et al.  An analytical approach to floorplan design and optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..