參考文獻 |
[1] R. A. Rutenbar, “Design automation for analog: the next generation of tool challenges”, in Proc. ICCAD, 2006, pp 458-460.
[2] J. Scheible and J. Lienig “Automation of Analog IC Layout Challenges and Solutions” Proc, International Symposium on Physical Design, pp.33-40, 2015
[3] H. Graeb, F. Balasa, R. Castro-Lopez, Y.-W. Chang, F.V. Fernandez, P.-H. Lin, M. Strasser, “Analog Layout Synthesis -Recent Advances in Topological Approaches,” in Proc. DATE, pp. 274-279, Apr. 2009.
[4] Y.-P. Weng, H.-M. Chen, T.-C. Chen, P.-C. Pan, C.-H. Chen, W.-Z. Chen, “Fast Analog Layout Prototyping for Nanometer Design Migration”, in Proc. ICCAD, pp. 517-522, Nov. 2011.
[5] P.-Y. Chou, H.-C. Ou, Y.-W. Chang, “Heterogeneous B*-trees for Analog Placement with Symmetry and Regularity Considerations,” in Proc. ICCAD, pp. 512-516, 2011
[6] L. Xiao, E.F.Y. Young, X. He, K.P. Pun, “Practical Placement and Routing Techniques for Analog Circuit Designs”, in Proc. ICCAD, pp. 675-679, 2010.
[7] M.-K. Hsu, S. Chou, T.-H. Lin, Y.-W. Chang, “Routability-driven analytical placement for mixed-size circuit designs”, in Proc. ICCAD, pp. 517-522, 2011
[8] C.-W. Lin, C.-C. Lu, J.-M. Lin, and S.-J. Chang, “Routability-driven Placement Algorithm for Analog Integrated Circuits,” in Pro., ISPD, pp.71-78,2012
[9] H.-C. Ou, H.-C. Chang Chien, Y.-W. Chang, "Non-uniform multilevel analog routing with matching constraints", in Proc. DAC, pp. 549-554, Jun. 2012
[10] H. Yao, Y. Cai, and Q. Gao, “LEMAR: A novel length matching routing algorithm for analog and mixed signal circuits,” in Proc. ASP-DAC, pp. 157–162. Feb. 2012,
[11] M. Ozdal and R. Hentschke, “Algorithms for Maze Routing with Exact Matching Constraints,” IEEE Trans. on Computer-Aided Design, vol. 33, no. 1, pp. 101-112, 2014.
[12] H.-Y. Chi, H.-Y. Tseng, C.-N. J. Liu, H.-M. Chen, “Performance-Preserved Analog Routing Methodology via Wire Load Reduction,” in Proc. ASP-DAC, Jan. 2018.
[13] P.-H. Lin, Y.-W. Chang, and S.-Ch. Lin, “Analog Placement Based on Symmetry-Island Formulation,” IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., pp. 791-804, June 2009.
[14] P.-H. Lin and S.-Ch. Lin, “Analog Placement Based on Hierarchical Module Clustering,” Proc. Design Automation Conference, pp. 50–55, 2008.
[15] H. E. Graeb. “ITRS 2011 Analog EDA Challenges and Approaches,” in Design, Automation & Test in Europe. Mar. 2012.
[16] Pradeep Kumar Chawda, “A Simplified Methodology for Complex Analog Module Layout Generation,” in Proc. ISQED, 2018
[17] Online resources, Electronic Design Automation. Course Outline, from https://slideplayer.com/slide/6642058/
[18] H. Habal and H. Graeb, “Constraint-Based Layout-Driven Sizing of Analog Circuits,” IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., vol.30, no.8. pp.1089-1102, Aug. 2011
[19] 樓禹慷, “自動辨識混合訊號電路中數位區塊之方法”, 中央大學碩士論文, June 2016
[20] Mentor Graphic® Caliber®, http://www.mentor.com
[21] J. Bastos, M. Steyaert, B. Graindourze, W. Sansen, “Matching of MOS Transistors with Different Layout Styles,” IEEE Int’l Conf. on Microelectronic Test Structures, pp. 17-18, Mar. 1996.
[22] M. Dessouky and M.-M. Louerat. “A Layout Approach for Electrical and Physical Design Integration of High-Performance Analog Circuits”, in Proc. Int’l Symp. on Quality Electronic Design, pp. 291–298, 2000.
[23] Ch.-W. Lee, H.-Y. Tseng, Ch.-L. Kuo, “Layout placement optimization with isolation rings for high-voltage VLSI circuits”, International Symposium on VLSI Design, Automation and Test (VLSI-DAT), 2017.
[24] Y.-Ch. Chang, Y.-W. Chang, G.-M. Wu, and Sh.-W. Wu, “B*-Trees: A New Representation for Non-Slicing Floorplans,” Proc. Design Automation Conference, pp. 458-463, 2000.
[25] LakerTM from Synopsys, http://www.synopsys.com
[26] Synopsys® Hspice®, http://www.synopsys.com
[27] Y.C. Liao, “A Layout-Aware Analog Synthesis Environment on Laker”, MS. Thesis, National Central University, Taiwan, June 2013
[28] H. E. Graeb, “Analog Layout Synthesis: A Survey of Topological Approaches,” Springer, Berlin, 2010
[29] Naveed A. Sherwani, “Algorithms for VLSI Physical Design Automation,” Springer, Boston, Mar,1999
[30] Lee, “An algorithm for path connection and its application,” IRE Trans. Electronic Computer, EC-10, 1961
[31] P. E. Hart, N. J. Nilsson, B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths". IEEE Trans. on Systems Science and Cybernetics SSC4. 4 (2): 100–107. doi:10.1109/TSSC.1968.
[32] Y.-Hs. Chen, H.-Y. Chi, L.-Y. Song, C.-N. J. Liu, H.-M. Chen, “A Structure-Based Methodology for Analog Layout Generation,” in Proc. SMACD, Jul. 2019.
|