模拟集成电路二维Stack生成及模块合并算法
作者:
基金项目:

Supported by the National Nature Science Foundation of China under Grant Nos.90307005 and 60121120706(国家自然科学基金); the National Nature Science Foundation of China and Research Grants Council of Hong Kong joint Project under Grant No.60218004(国家自然基金与香港研究资助局联合资助);the National Natural Science Foundation of USA (NSF) under Grant No. CCR-0096383 (美国国家自然科学基金);the National High-Tech Research and Development Plan of China under Grant No.2002AA1Z1460 (国家高技术研究发展计划(863))

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [24]
  • |
  • 相似文献
  • | | |
  • 文章评论
    摘要:

    在模拟集成电路设计中,关于X轴和y轴同时对称的Stack,以及模块之间的合并,对于增加器件之间的匹配和控制寄生是至关重要的.描述了模拟集成电路二轴对称Stack生成算法和模块合并算法.通过对于对称欧拉图和对称欧拉路径的研究,得出了多项理论结果.在此基础上,提出了时间复杂度为O(n)的伪器件插入算法、对称欧拉路径构造算法和二轴对称Stack生成算法.生成的Stack,不但关于X轴和y轴对称,而且具有公共质心(commoncentroid)的结构.还描述了模块合并算法,给出了计算最大合并距离的公式.该算法本质上是独立于任何拓扑表示的.实验结果验证了算法的有效性.

    Abstract:

    In analog VLSI design, 2-dimensional symmetry stack and block merging are critical for mismatch minimization and parasitic control. In this paper, algorithms for analog VLSI 2-dimensional symmetry stack and block merging are described. Several theoretical results are obtained by studying symmetric Eulerian graph and symmetric Eulerian trail. Based on them, an O(n) algorithm for dummy transistor insertion, symmetric Eulerian trail construction and 2-dimensional symmetry stack construction is developed. The generated stacks are 2-dimensional symmetric and common-centroid. A block merging algorithm is described, which is essentially independent of the topological Eepresentation. Formula for calculating the maximum block merging distance is given. Experimental results show the effectiveness of the algorithms.

    参考文献
    [1]Cohn JM, Garrod DJ, Rutenbar RA, Carley LR. KOAN/ANAGRAM II: New tools for device-level analog placement and routing.IEEE Journal of Solid State Circuits, 1991,26(3):330~342.
    [2]Cohn J, Garrod D, Rutenbar R, Carley LR. Analog Device-Level Layout Generation. Norwell: Kluwer, 1994.
    [3]Garrod D, Rutenbar R, Carley LR. Automatic layout of custom analog cells in ANAGRAM In: Proc. of the ACM/IEEE Int. Conf.Computer-Aided Design (ICCAD). Nov. 1988. 544~547.
    [4]Gatti U, Maloberti F, Liberali V. Full stacked layout of analog cells. In: Proc. of the IEEE Int'l Symp. on Circuits and Systems.1989. 1123~1126.
    [5]Malavasi E, Pandini D. Optimum CMOS stack generation with analog constraints IEEE Trans. on Computer-Aided Design,1995,14:107~122.
    [6]Arsintescu GB, Spanoche SA. Global generation of MOS transistor stacks. IEEE EuroDAC, 1996.
    [7]Basaran A, Rutenbar RA. An O(n) algorithm for transistor stacking with performance constraints In: Proc. of the IEEE/ACM DAC.1996. 221~226.
    [8]Zeng X, Li MY, Zhao WQ, Tang PS, Zhou D. Parasitic and mismatch modeling for optimal stack generation. In: Proc. of the IEEE ISCAS 2000, Geneva, Switzerland, May 23-31, 2000.
    [9]Bastos J, Steyaert M, Graindourze B, Sansen W. Matching of MOS transistors with different layout styles. In: Proc. of the IEEE Int'l Conf. on Microelectronic Test Structures 1996. 17~18.
    [10]Bastos J, Steyaert M, Graindourze B, Sansen W. Influence of die bonding on MOS transistor matching. In: Proc. of the IEEE Int'l Conf. on Microelectronic Test Structures 1996. 17~31.
    [11]Murata H, Fujiyoshi K, Nakatake S, Kajitani Y. Rectangle-Packing-Based module placement In: Proc. of the IEEE Int'l Conf.Computer-Aided Design. 1995. 472~479.
    [12]Murata H, Fujiyoshi K, Nakatake S, Kajitani Y. VLSI module placement based on rectangle- packing by the sequence pair. IEEE Trans. Computer-Aided Design, 1996,15(11): 1518~ 1524.
    [13]Nakatake S, Fujiyoshi K, Murata H, Kajitani Y. Bounded-Slicing structure for module placement Technical Report, Institute of Electronics, Information, and Communication Engineers (IEICE) 1994. 19~24.
    [14]Nakatake S, Fujiyoshi K, Murata H, Kajitani Y. Module placement on BSG-structure and IC layout applications In: Proc. of the IEEE Int'l Conf. Computer-Aided Design, 1996. 484~491.
    [15]Guo PN, Cheng CK, Yoshimura T. An O-tree representation of non-slicing floorplan and its applications In: Proc. of the 36th ACM/IEEE Design Automation Conf. 1999.268~273.
    [16]Hong XL, Huang G, et al. Comer block list: An effective and efficient topological representation of non-slicing floorplan. In: Proc.of the IEEE Int'l Conf. Computer-Aided Design 2000. 2000.
    [17]Balasa F, Lampaert K. Symmetry within the sequence-pair representation in the context of placement for analog design. IEEE Trans. on Computer-Aided Design and System, 2000,19(7).
    [18]Pang YX, Balasa F, Lampaert K, Cheng CK. Block placement with symmetry constraints based on the O-tree non-slicing representation. In: Proc. of the IEEEDAC 2000. 2000. 464~467.
    [19]Liu R, Hong LX, Dong SQ, Gu J. VLSI/PCB placement with predefined coordinate alignment constraint based on sequence pair. In:Proc. of the IEEE ASICON 2001. 2001. 167~170.
    [20]Liu R, Hong XL, Dong SQ, Gu J, Cheng CK. Module placement with boundary constraints using O-tree representation. In: Proc. of the IEEE ISCAS 2002. 2002.871~874.
    [21]Liu R, Hong XL, Dong SQ, Gu J. Block placement with predefined coordinate alignment constraint using sequence pair representation. Journal of Software, 2003,14(8):1418~1424 (in English with Chinese abstract) http://www.jos.org.cn/l000-9825/14/1418.htm
    [22]Ismail M, Fiez TS. Analog VLSI: Signal and Information Processing. New York: McGrawHill, 1994.
    [23]Basaran B, Rutenbar RA, Carley LR. Latchup-Ware placement and parasitic-bounded routing of custom analog cells. In: Proc. of the IEEE/ACM Int'l Conf. on Computer-Aided Design. 1993.415~421.
    [24]刘锐,洪先龙,董社勤,顾钧基于序列对表示的对齐约束模块布局算法.软件学报,2003,14(8):1418~1424.http:∥www.jos.org.cn/1000-9825/14/1418.htm
    相似文献
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

刘锐,董社勤,洪先龙,龙迪,顾钧.模拟集成电路二维Stack生成及模块合并算法.软件学报,2004,15(5):641-649

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2002-10-18
  • 最后修改日期:2003-07-16
文章二维码
您是第19876196位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号