English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 54908/89265 (62%)
造訪人次 : 10600916      線上人數 : 34
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/38834

    題名: A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning
    作者: 鄭國興;Cheng, Kuo-hsing;Cheng, Shun-wen
    貢獻者: 淡江大學電機工程學系
    日期: 2001-09
    上傳時間: 2010-04-15 11:33:46 (UTC+8)
    出版者: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: In this paper, we find the relationship between mincut circuit partitioning and the initial (V, E) pairs distributed condition/entropy on the V-E plain. If a circuit has higher initial potential/entropy, under a nearly max-cut reservation, we have a higher probability to aim the mincut. The proposed new method is called Interleaved Cutting-Edge-Node Interleaved Sort for Leaching and Envelop (IC-ENISLE) algorithm. It not only uses node and edge information, but also uses the max-min dual property. This new method is simple, but works effectively. Hundreds of netlist experiments have ever been processed. It shows that we can soon get an intuitive heuristic nearly optimal solution for the mincut and the ratio mincut partitioning at the same time. Also the method can display every process step by data compression techniques, is very suitable for IC CAD industrial usage.
    關聯: Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on (Volume:2 ), pp.889-893
    DOI: 10.1109/ICECS.2001.957616
    顯示於類別:[電機工程學系暨研究所] 會議論文


    檔案 描述 大小格式瀏覽次數
    0780370570_2p889-893.pdf415KbAdobe PDF555檢視/開啟



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋