A novel detailed routing algorithm with exact matching constraint for analog and mixed signal circuits
暂无分享,去创建一个
[1] Erich Barke,et al. Algorithms for automatic length compensation of busses in analog integrated circuits , 2007, ISPD '07.
[2] Masahiro Fujita,et al. An efficient algorithm for the net matching problem , 1993, ICCAD.
[3] 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.
[4] David Harris,et al. CMOS VLSI Design: A Circuits and Systems Perspective , 2004 .
[5] R. Stephenson. A and V , 1962, The British journal of ophthalmology.
[6] Neil Genzlinger. A. and Q , 2006 .
[7] Jason Cong,et al. DUNE: a multi-layer gridless routing system with wire planning , 2000, ISPD '00.
[8] Yici Cai,et al. A shortest-path-search algorithm with symmetric constraints for analog circuit routing , 2005, 2005 6th International Conference on ASIC.
[9] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[10] Tan Yan,et al. BSG-Route: a length-matching router for general topology , 2008, ICCAD 2008.
[11] 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.
[12] 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.