On Finding A Staircase Channel With Minimum Crossing Nets In A VLSI Floorplan

A VLSI chip is fabricated by integrating several rectangular circuit blocks on a 2D silicon floor. The circuit blocks are assumed to be placed isothetically and the netlist attached to each block i...

[1]  Subhas C. Nandy,et al.  On finding an empty staircase polygon of largest area (width) in a planar point-set , 2003, Comput. Geom..

[2]  Cheng-Kok Koh,et al.  Routability-driven repeater block planning for interconnect-centricfloorplanning , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Susmita Sur-Kolay,et al.  Area(number)-balanced hierarchy of staircase channels with minimum crossing nets , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).

[4]  Jason Cong,et al.  Performance optimization of VLSI interconnect layout , 1996, Integr..

[5]  Dinesh P. Mehta,et al.  The quarter-state-sequence floorplan representation , 2003 .

[6]  Martin D. F. Wong,et al.  Closed form solution to simultaneous buffer insertion/sizing and wire sizing , 1997, ISPD '97.

[7]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[8]  Susmita Sur-Kolay,et al.  The cycle structure of channel graphs in nonsliceable floorplans and a unified algorithm for feasible routing order , 1991, [1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[9]  Parthasarathi Dasgupta,et al.  Searching networks with unrestricted edge costs , 2001, IEEE Trans. Syst. Man Cybern. Part A.

[10]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11]  Martin D. F. Wong,et al.  Network flow based multi-way partitioning with area and pin constraints , 1997, ISPD '97.

[12]  Yoji Kajitani,et al.  VLSI module placement based on rectangle-packing by the sequence-pair , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[14]  Jason Cong,et al.  Interconnect Layout Optimization by Simultaneous Steiner Tree Construction and Buffer Insertion , 1996 .

[15]  Susmita Sur-Kolay,et al.  Manhattan-diagonal routing in channels and switchboxes , 2004, TODE.

[16]  Robert E. Tarjan,et al.  A faster deterministic maximum flow algorithm , 1992, SODA '92.

[17]  Jason Cong,et al.  Buffer block planning for interconnect-driven floorplanning , 1999, 1999 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (Cat. No.99CH37051).

[18]  Parthasarathi Dasgupta,et al.  Monotone bipartitioning problem in a planar point set with applications to VLSI , 2002, TODE.

[19]  Jason Cong,et al.  Interconnect delay estimation models for synthesis and design planning , 1999, Proceedings of the ASP-DAC '99 Asia and South Pacific Design Automation Conference 1999 (Cat. No.99EX198).

[20]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.