期刊文献+

高频时钟网络布线拓扑结构的曼哈顿平面切割线生成算法 被引量:3

An Manhattan Cut-Line Generation Algorithm for the Topology of Clock Routing
下载PDF
导出
摘要 在传统的Planar DME拓扑划分算法的基础上,提出一种将欧几里德平面上的拓扑连接线转换成曼哈顿平面上的切割线并建立虚拟通道的算法,来进行连线调整,完成时钟网络的零时滞平面化布线 Nowadays the IC industry has entered a era of large scale and high frequency, so the zero-skew and signal integrity in the clock routing become important problems to be resolved. Based on the Planar-DME topology generation algorithm, we present a Manhattan cut-line generation algorithm, which complete the conversion from the topology lines on the Euclidean plane to cut-lines on Manhattan plane and then construct the virtual channel for latter wire adaptation and connection. Applied to a pipelined clock tree building algorithm, finally we build a zero-skew planar clock tree. A prototype ClockStar is developed using the algorithm. Some examples have been tested and the results are promising.
出处 《计算机辅助设计与图形学学报》 EI CSCD 北大核心 2005年第5期1068-1073,共6页 Journal of Computer-Aided Design & Computer Graphics
基金 国家自然科学基金 ( 60 1760 17) 国家自然科学基金海外杰出青年学者合作研究基金 ( 6992 840 2 ) 国家自然科学基金 SOC重点项目( 90 2 0 70 0 2 ) 国家"八六三"高技术研究发展计划( 2002AA1Z13 40 2 002AA1Z14 60) 教育部科学技术重点项目 ( 0 2 0 95)
关键词 时钟树综合 曼哈顿平面布线 切割线生成 clock tree synthesis Manhattan plane routing cut line generation
  • 相关文献

参考文献8

  • 1Jackson Michael A B, Srinivasan Arvind, Kuh E S. Clock routing for high-performance Ics [A]. In: Proceedings of the 27th Design Automation Conference, Orlando, 1990. 573~579
  • 2Edahiro M. Minimum skew and minimum path length routing in VLSI layout design [J]. NEC Reseach and Development,1991, 32(4): 569~575
  • 3Andrew B. Kahng, Chung-Wen Albert Tsao. Planar-DME: A single-layer zero-skew clock tree router [J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,1996, 15(1): 8~19
  • 4Kahng Andrew B, Tsao Chung-Wen Albert. Low-cost singlelayer clock trees with exact zero Elmore delay skew [A].International Conference on Computer-Aided Design, San Jose,1994. 213~218
  • 5金剑松,周丽丽,赵文庆,曾璇.GHz零时滞时钟树物理布图的虚拟通道布线算法[J].计算机辅助设计与图形学学报,2003,15(6):656-661. 被引量:1
  • 6Jin Jiansong. A routing algorithm based on the slanting partition for the planar and zero skew clock circuit [ D]. Shanghai: Fudan University, 2003 (in Chinese)(金剑松.基于斜线划分的平面化零时滞时钟布线算法研究[硕士学位论文].上海:复旦大学,2003)
  • 7Zeng X, Zhou D. Design of GHz VLSI clock distribution circuit[A]. In: Proceedings of IEEE International Symposium On Circuit and Systems, Sydney, 2001. 391~394
  • 8Lu T T, Song J J, Zhao W Q. A routing algorithm of clock distribution circuit of high frequency [A]. In: Proceedings of the 5th International ASIC Conference, Beijing, 2003. 369~372

二级参考文献11

  • 1Kahng A, Cong J, Robins G. High-performance clock routing based on recursive geometric matching[A]. In: Proceedings of the 28th ACM/IEEE Design Automation Conference, San Francisco, 1991. 322~327
  • 2Jackson M A B, Srinivasan A, Kuh E S. Clock routing for high-performance Ics[A]. In: Proceedings of the 27th ACM/IEEE Design Automation Conference, Orlando, 1990. 573~579
  • 3Kahng A B, Tsao C-W A. Low-cost single-layer clock trees with exact zero Elmore delay skew[A]. In: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, San Jose, 1994. 213~218
  • 4Zhu Q, Dai W W -M. Perfect balance planar clock routing with minimal path-length[A]. In: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, Santa Clara, 1992. 473~476
  • 5Kahng A B, Albert Tsao Chung-Wen. Planar-dme: A single-layer zero-skew clock tree router[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996, 15 (1) : 8~19
  • 6Cong J, Kahng A B, Koh C -K, et al. Bounded-skew clock and Steiner routing under Elmore delay[A]. In: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, San Jose, 1995. 66~71
  • 7Kim H, Zhou D. An automatic clock tree design system for high-speed VLSI designs: Planar clock routing with the treatment of obstacles[A]. In: Proceedings of the IEEE International Symposium on Circuits and Systems, Orlando, 1999. 258~261
  • 8Zeng X, Zhou D, Li Wei. Buffer insertion for clock delay and skew minimization[A]. In: Proceedings of the ACM International Symposium on Physical Design, Monterey, 1999. 36~41
  • 9Zhou D, Zeng X. Design of GHz VLSI clock distribution circuit[A]. In: Proceedings of the IEEE International Symposium on Circuits and Systems, Sydney, 2001. v391~v394
  • 10Ismail Y I, Friedman E G, Neves J L. Equivalent Elmore delay for RLC trees[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2000, 19 (1) : 83~97

同被引文献21

  • 1陈宏建,陈崚,徐晓华,屠莉.改进的增强型蚁群算法[J].计算机工程,2005,31(2):176-178. 被引量:24
  • 2蔡懿慈,熊焰,洪先龙,刘毅.考虑工艺参数变化的安全时钟布线算法[J].中国科学(E辑),2005,35(8):887-896. 被引量:8
  • 3杨剑峰,蒋静坪.蚁群算法及其在组合优化问题中的应用[J].科技通报,2006,22(4):553-556. 被引量:6
  • 4黄训诚,庄奕琪,耿阿囡,杨丰辉.蚁群算法用于VLSI布线的特性分析[J].网络安全技术与应用,2006(9):76-77. 被引量:1
  • 5Colomi A.Dorigo M.,Maniezzo V.Distributed Optimization by Ant Colonies[M].Proc. 1st European Conf.Artificial Life Pans, France: Elsevier,1991:134-142.
  • 6Dorigo M, Maniezzo V, and Colomi A. The Ant System: Optimization by a Colony of Cooperating Agents[J].IEEE Trans on Systems, Mon,and Cybernetics-Part B,1996,26 (1):1-13.
  • 7Neves J L,Friedman E G.Optimal clock skew scheduling tolerant to process variations[C]//Proceedings of IEEE/ACMInternational Conference on Deign Automation,Las Vegas,NV,1996:623-628
  • 8Kourtev I S,Friedman E G.Clock skew scheduling for improved reliability via quadratic programming[C]//Proceedings of IEEE/ACM International Conference on Computer-Aided Design,San Jose,CA,1999:239-243
  • 9Held S,Korte B,Maβberg J,et al.Clock scheduling and clocktree construction for high performance ASICs[C]//Proceedings of IEEE/ACM International Conference on Computer-Aided Deign,San Jose,CA,2003:232-239
  • 10Young N E,Tarjan R E,Orlin J B.Faster parametric shortest path and minimum balance algorithms[J].Networks,1991,21(2):1-17

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部