A device-level placement with multi-directional convex clustering

A challenge to an automated layout of analog IC starts with the insight into a high quality placement crafted by experts. It has been observed that such a placement comprises clusters corresponding to groups of matched devices and devices are placed faithfully to the drawn schema while the placement is still compacted. This paper proposes a novel device-level placement based on Sequence-Pair which includes an effective representation of clusters extracted from the schema. A key idea is to capture a topological structure of clusters in order to place clusters at as faithful positions to those in the schema. We represent this structure in terms of ABLR-relations which can be translated into Sequence-Pair. In experiments, we tested our algorithm for industrial instances and compared the results with those by manual. We showed that our results were better than manual results by, on average, 12.8% and 18.1% with respect to area and net-length.

[1]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

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

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

[4]  M. Queyranne.  Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems , 1986 .

[5]  Andrew B. Kahng.  A roadmap and vision for physical design , 2002, ISPD '02.

[6]  Gi-Joon Nam,et al.  The ISPD2005 placement contest and benchmark suite , 2005, ISPD '05.

[7]  Joseph R. Shinnerl,et al.  mPL6: enhanced multilevel mixed-size placement , 2006, ISPD '06.

[8]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[10]  H. Murata,et al.  Rectangle-packing-based module placement , 1995, ICCAD 1995.

[11]  John M. Cohn.  Analog Device-Level Layout Automation , 1994 .

[12]  J. Litsios,et al.  ILAC: an automated layout tool for analog CMOS circuits , 1989 .

[13]  Ulrich Brenner,et al.  An effective congestion driven placement framework , 2002, ISPD '02.

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

[15]  Andrew B. Kahng,et al.  Highly scalable algorithms for rectilinear and octilinear Steiner trees , 2003, ASP-DAC '03.

[16]  Jason Cong,et al.  Routability-driven placement and white space allocation , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[17]  Konrad Doll,et al.  Analytical placement: a linear or a quadratic objective function? , 1991, 28th ACM/IEEE Design Automation Conference.

[18]  Carl Sechen,et al.  Efficient and effective placement for very large circuits , 1993, ICCAD.

[19]  Joseph R. Shinnerl,et al.  Large-Scale Circuit Placement: Gap and Promise , 2003, ICCAD 2003.

[20]  S. W. Mehranfar.  A technology-independent approach to custom analog cell generation , 1991 .

[21]  Andrew B. Kahng,et al.  Can recursive bisection alone produce routable, placements? , 2000, Proceedings 37th Design Automation Conference.

[22]  Alberto L. Sangiovanni-Vincentelli,et al.  Automation of IC layout with analog constraints , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[23]  P. Spindler,et al.  Fast and Robust Quadratic Placement Combined with an Exact Linear Net Model , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[24]  P. Bai,et al.  A 65nm logic technology featuring 35nm gate lengths, enhanced channel strain, 8 Cu interconnect layers, low-k ILD and 0.57 /spl mu/m/sup 2/ SRAM cell , 2004, IEDM Technical Digest. IEEE International Electron Devices Meeting, 2004..

[25]  Yoji Kajitani,et al.  Module placement on BSG-structure and IC layout applications , 1996, ICCAD 1996.

[26]  Chris C. N. Chu,et al.  An efficient and effective detailed placement algorithm , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

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

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

[29]  Andrew B. Kahng,et al.  Design and implementation of move-based heuristics for VLSI hypergraph partitioning , 2000, JEAL.

[30]  Andrew B. Kahng,et al.  A tale of two nets: studies of wirelength progression in physical design , 2006, SLIP '06.

[31]  Andrew B. Kahng,et al.  APlace: a general analytic placement framework , 2005, ISPD '05.

[32]  Georges Gielen,et al.  Analog layout generation for performance and manufacturability , 1999 .

[33]  Georg Sigl,et al.  GORDIAN: VLSI placement by quadratic programming and slicing optimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[34]  Yao-Wen Chang,et al.  IMF: interconnect-driven multilevel floorplanning for large-scale building-module designs , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[35]  Robert K. Brayton,et al.  Timing optimization of combinational logic , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[36]  Chris C. N. Chu,et al.  FastPlace: efficient analytical placement using cell shifting, iterative local refinement,and a hybrid net model , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[37]  David S. Johnson,et al.  The Rectilinear Steiner Problem is NP-Complete , 1977 .

[38]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[39]  Chris C. N. Chu.  FLUTE: fast lookup table based wirelength estimation technique , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

[40]  Martin D. F. Wong,et al.  FAST-SP: a fast algorithm for block placement based on sequence pair , 2001, ASP-DAC '01.