Wire Planning for Electromigration and Interference Avoidance in Analog Circuits

This study formulates and solves the wire planning problem with electro-migration and interference using an effective integer linear programming (ILP)-based approach. For circuits without obstacles, the proposed approach obtains a wire planning with the minimum wiring area. An effective approach for estimating the length of feasible routing wire is proposed to handle circuits with obstacles. In addition, the space reservation technique, which allocates the ring of the free silicon space around obstacles, is presented to improve interference among routing wires and on-obstacle wires. For circuits with obstacles, the proposed method minimizes total wiring area and reduces interference. Experimental results show that the integer linear-programming-based approach effectively and efficiently minimizes wiring area of routing wires.

[1]  Jens Lienig,et al.  introduction to electromigration-aware physical design , 2006, ISPD '06.

[2]  K. Thyagarajan,et al.  Optimal V/sub th/ assignment and buffer insertion for simultaneous leakage and glitch minimization though integer linear programming (ILP) , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..

[3]  Jens Lienig,et al.  Reliability-driven layout decompaction for electromigration failure avoidance in complex mixed-signal IC designs , 2004, Proceedings. 41st Design Automation Conference, 2004..

[4]  Tongquan Wei,et al.  An Interconnect Reliability-Driven Routing Technique for Electromigration Failure Avoidance , 2012, IEEE Transactions on Dependable and Secure Computing.

[5]  Yang Yang,et al.  Rectilinear Steiner Minimal Tree among obstacles , 2003, ASICON 2003.

[6]  Tsung-Yi Ho.  PIXAR: A performance-driven X-architecture router based on a novel multilevel framework , 2009, Integr..

[7]  J. Black.  Physics of Electromigration , 1974 .

[8]  Xianlong Hong,et al.  Timing-driven global routing with efficient buffer insertion , 2005, ISCAS.

[9]  Ting-Chi Wang,et al.  A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction , 2007, 2007 Asia and South Pacific Design Automation Conference.

[10]  Zhi-Wei Chen,et al.  Electromigration-aware rectilinear Steiner tree construction for analog circuits , 2008, APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems.

[11]  Jens Lienig,et al.  Current-driven wire planning for electromigration avoidance in analog circuits , 2003, ASP-DAC '03.

[12]  Jens Lienig,et al.  Electromigration avoidance in analog circuits: two methodologies for current-driven routing , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.

[13]  Martin D. F. Wong,et al.  Network flow based buffer planning , 2001, Integr..

[14]  D. T. Lee,et al.  Crosstalk- and performance-driven multilevel full-chip routing , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Jun Gu,et al.  A buffer planning algorithm with congestion optimization , 2004 .

[16]  Chien-Nan Jimmy Liu,et al.  An Efficient Power Model for IP-Level Complex Designs , 2003 .

[17]  Hsin-Hsiung Huang,et al.  Obstacle-avoiding electromigration aware wire planning for analog circuits , 2009, Proceedings of the 2009 12th International Symposium on Integrated Circuits.

[18]  Qing Su,et al.  Wirelength reduction by using diagonal wire , 2003, GLSVLSI '03.

[19]  Yusuke Matsunaga,et al.  A Behavioral Synthesis Method with Special Functional Units , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[20]  Chris C. N. Chu,et al.  FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[21]  Jun Gu,et al.  Buffer planning as an Integral part of floorplanning with consideration of routing congestion , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[22]  Jens Lienig,et al.  Constraint-driven design: the next step towards analog design automation , 2009, ISPD '09.

[23]  Shih-Hsu Huang,et al.  An ILP Approach to the Simultaneous Application of Operation Scheduling and Power Management , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[24]  Hsin-Hsiung Huang,et al.  Optimal Supply Voltage Assignment under Timing, Power and Area Constraints , 2010, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[25]  Chris C. N. Chu,et al.  An efficient routing tree construction algorithm with buffer insertion, wire sizing, and obstacle considerations , 2005, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[26]  Lars Hedrich,et al.  A current driven routing and verification methodology for analog applications , 2000, Proceedings 37th Design Automation Conference.

[27]  Iris Hui-Ru Jiang,et al.  Optimal wiring topology for electromigration avoidance considering multiple layers and obstacles , 2010, ISPD '10.

[28]  Hsin-Hsiung Huang,et al.  A congestion-driven buffer planner with space reservation , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[29]  J. Black.  Electromigration failure modes in aluminum metallization for semiconductor devices , 1969 .

[30]  Erich Barke,et al.  Single step current driven routing of multiterminal signal nets for analog applications , 2000, DATE '00.

[31]  Chris C. N. Chu,et al.  Efficient rectilinear Steiner tree construction with rectilinear blockages , 2005, 2005 International Conference on Computer Design.

[32]  Jens Lienig,et al.  AnalogRouter: a new approach of current-driven routing for analog circuits , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

[33]  Azadeh Davoodi,et al.  Effective techniques for the generalized low-power binding problem , 2006, TODE.

[34]  Masahiro Fujita,et al.  Synchronization verification in system-level design with ILP solvers , 2005, Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2005. MEMOCODE '05..