A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning
學年 90
學期 1
發表日期 2001-09-02
作品名稱 A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning
作品名稱（其他語言）
著者 鄭國興; Cheng, Kuo-hsing; Cheng, Shun-wen
作品所屬單位 淡江大學電機工程學系
出版者 Institute of Electrical and Electronics Engineers (IEEE)
會議名稱 Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on
會議地點 Malta
摘要 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.
關鍵字
語言 en
收錄於
會議性質 國際
校內研討會地點
研討會時間 20010902~20010905
通訊作者
國別 MLT
公開徵稿
出版型式 紙本
出處 Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on (Volume:2 ), pp.889-893
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/38834 )

機構典藏連結