Length matching in detailed routing for analog and mixed signal circuits

Abstract Heterogeneous integration in modern System-On-Chips (SOCs) drives the design automation process for analog and mixed signal circuit components, where matching constraints for certain analog signals are critical for correct functionality. This paper presents a detailed routing solution for analog nets with the single-layer length matching constraint called LEMAR, i.e., a single-layer LEngth MAtching Router. LEMAR is a gridless router using a non-uniform grid routing model to ensure the length matching constraint. LEMAR has the following features: (1) an effective routing model is used for layout partitioning and wire detouring, (2) detouring patterns are presented to obtain the given detouring length, and (3) an enhanced A ⁎ search algorithm along with backtracking technique is presented for finding a routing solution with the length matching constraint. Experimental results are promising.

[1]  Tan Yan,et al.  BSG-Route: a length-matching router for general topology , 2008, ICCAD 2008.

[2]  Rob A. Rutenbar,et al.  Layout tools for analog ICs and mixed-signal SoCs: a survey , 2000, ISPD '00.

[3]  Jason Cong,et al.  DUNE: a multi-layer gridless routing system with wire planning , 2000, ISPD '00.

[4]  Alessandro De Gloria,et al.  A Tile-Expansion Router , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[5]  David Harris,et al.  CMOS VLSI Design: A Circuits and Systems Perspective , 2004 .

[6]  Yici Cai,et al.  A shortest-path-search algorithm with symmetric constraints for analog circuit routing , 2005, 2005 6th International Conference on ASIC.

[7]  S. Sitharama Iyengar,et al.  Finding obstacle-avoiding shortest paths using implicit connection graphs , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Yih-Lang Li,et al.  NEMO: A New Implicit-Connection-Graph-Based Gridless Router With Multilayer Planes and Pseudo Tile Propagation , 2007, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Carl Sechen,et al.  Chip-level area routing , 1998, ISPD '98.

[10]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[11]  Erich Barke,et al.  Routing of analog busses with parasitic symmetry , 2005, ISPD '05.

[12]  Masahiro Fujita,et al.  An efficient algorithm for the net matching problem , 1993, ICCAD.

[13]  Russell Kao,et al.  Shortest path search using tiles and piecewise linear costpropagation , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Hsin-Yu Chen,et al.  NEMO: A New Implicit-Connection-Graph-Based Gridless Router With Multilayer Planes and Pseudo Tile Propagation , 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[15]  Muhammet Mustafa Ozdal,et al.  Exact route matching algorithms for analog and mixed signal integrated circuits , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.

[16]  Qiang Gao,et al.  A novel detailed routing algorithm with exact matching constraint for analog and mixed signal circuits , 2011, 2011 12th International Symposium on Quality Electronic Design.

[17]  Rob A. Rutenbar,et al.  Design Automation for Analog: The Next Generation of Tool Challenges , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.

[18]  Asmus Hetzel,et al.  A sequential detailed router for huge grid graphs , 1998, Proceedings Design, Automation and Test in Europe.

[19]  Martin D. F. Wong,et al.  A Length-Matching Routing Algorithm for High-Performance Printed Circuit Boards , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[20]  Carl Sechen,et al.  A gridless multilayer router for standard cell circuits using CTMcells , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  Erich Barke,et al.  Algorithms for automatic length compensation of busses in analog integrated circuits , 2007, ISPD '07.

[22]  Qiang Gao,et al.  LEMAR: A novel length matching routing algorithm for analog and mixed signal circuits , 2012, 17th Asia and South Pacific Design Automation Conference.

[23]  Muhammet Mustafa Ozdal,et al.  Maze routing algorithms with exact matching constraints for analog and mixed signal designs , 2012, 2012 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[24]  Chia-Chun Tsai,et al.  An H-V alternating router , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[25]  Walter S. Scott,et al.  An interactive maze router with hints , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..