一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

一個VLSI三層布線通孔最少化的啟發(fā)式算法

馬琪,  嚴(yán)曉浪

馬琪, 嚴(yán)曉浪. 一個VLSI三層布線通孔最少化的啟發(fā)式算法[J]. 電子與信息學(xué)報, 2001, 23(10): 1014-1021.
引用本文: 馬琪, 嚴(yán)曉浪. 一個VLSI三層布線通孔最少化的啟發(fā)式算法[J]. 電子與信息學(xué)報, 2001, 23(10): 1014-1021.
Ma Qi, Yan Xiaolang. A HEURISTIC ALGORITHM TO THREE-LAYER CONSTRAINED VIA MINIMIZATION[J]. Journal of Electronics & Information Technology, 2001, 23(10): 1014-1021.
Citation: Ma Qi, Yan Xiaolang. A HEURISTIC ALGORITHM TO THREE-LAYER CONSTRAINED VIA MINIMIZATION[J]. Journal of Electronics & Information Technology, 2001, 23(10): 1014-1021.

一個VLSI三層布線通孔最少化的啟發(fā)式算法

A HEURISTIC ALGORITHM TO THREE-LAYER CONSTRAINED VIA MINIMIZATION

  • 摘要: 該文在三層布線的線段-相交圖模型基礎(chǔ)上,提出了一個啟發(fā)式算法來解決VLSI三層布線通孔最少化問題,該算法通過總體優(yōu)化和局部優(yōu)化兩個階段對三層布線進(jìn)行通孔優(yōu)化。算法考慮了實(shí)際約束的處理方法,并進(jìn)行大量的布線實(shí)例驗(yàn)證。
    Abstract: In this paper, a heuristic approach for constrained via minimization for VLSI three-layer routing on the basis of segment-crossing graph model is presented. Two types of algorithm-global sense and local sense are combined into the new algorithm. In addition, many physical constraints are taken into consideration. According to the results, this algorithm is verified to be very efficient and encouraging.
    • HTML全文
  • K.C. Chang, D. H-C. Du, Layer assignment problem for 3-layer routing, IEEE Trans. on Computer, 1988, C-37(5), 625-629.[2]K.E. Chang, H. F. Jyu, W. S. Feng, Constrained via minimization for three-layer routing, IEEE Trans. on Computer-Aided Design, 1989, CAD-2(6), 346-354.[3]S.C. Fang, K. E. Chang, W. S. Feng, S. J. Chen, Constrained via minimization with practical consideration for multi-layer VLSI/PCB routing problem, in Proc. 28th ACM/IEEE Design Automation Conf., 1991, 4, 5, 60-65.[4]K. Ann, S. Sahni, Constrained via minimization, IEEE Trans. on CAD of IC and Sys., 1993,12(2), 273-282.[5]J.S. Cherng, S. J. Chen, C. C. Tsai, J. M. Ho, An efficient approach for via minimization in multi-layer VLSI/PCB routing, in Proc. IEEE Custom Integrated Circuits Conf., 1995, 473-476.[6]K. Takahashi, T. Watanabe, A heuristic algorithm to solve constrained via minimization for three-layer routing problem, in Proc. ISCAS, 1998, 486-490.[7]Y.K. Chen, M. L. Liu, Three-layer channel routing, IEEE Trans. on Computer-Aided Design,1984, CAD-3(2), 156-163.
  • 加載中
計量
  • 文章訪問數(shù):  2162
  • HTML全文瀏覽量:  97
  • PDF下載量:  444
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  1999-09-06
  • 修回日期:  2000-02-13
  • 刊出日期:  2001-10-19

目錄

    /

    返回文章
    返回