A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 會議論文 > Item 987654321/38834

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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.pdf		415Kb	Adobe PDF	665	检视/开启
index.html		0Kb	HTML	284	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章