论文信息 - A new faster sequence pair algorithm [circuit layout]

A new faster sequence pair algorithm [circuit layout]

This paper introduces a new sequence pair algorithm which has a complexity lower than O(M/sup 1.25/), which is a significant improvement compared to the original O(M/sup 2/) algorithm. Furthermore, the new algorithm has complexity close to the theoretical lower bound. Experimental results, obtained with a straightforward implementation, confirm this improvement in complexity.

Domine Leenaerts | C. Lin

[1] Florin Balasa,et al. Module placement for analog layout using the sequence-pair representation , 1999, DAC '99.

[2] Georges Gielen,et al. A performance-driven placement tool for analog integrated circuits , 1995 .

[3] Jin Xu,et al. Sequence-pair approach for rectilinear module placement , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4] Domine Leenaerts,et al. A new efficient method for substrate-aware device-level placement , 2000, Proceedings 2000. Design Automation Conference. (IEEE Cat. No.00CH37106).

[5] C. Lin,et al. A new efficient method for substrate-aware device-level placement (short paper) , 2000, ASP-DAC '00.

[6] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .

[7] Karem A. Sakallah,et al. Transistor level micro-placement and routing for two-dimensional digital VLSI cell synthesis , 1999, ISPD '99.

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

[9] Rob A. Rutenbar,et al. Substrate-aware mixed-signal macrocell placement in WRIGHT , 1995 .