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

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Proceeding > Item 987654321/38834

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/38834

Title:	A study on the relationship between initial node-edge pairs entropy and mincut circuit partitioning
Authors:	鄭國興;Cheng, Kuo-hsing;Cheng, Shun-wen
Contributors:	淡江大學電機工程學系
Date:	2001-09
Issue Date:	2010-04-15 11:33:46 (UTC+8)
Publisher:	Institute of Electrical and Electronics Engineers (IEEE)
Abstract:	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.
Relation:	Electronics, Circuits and Systems, 2001. ICECS 2001. The 8th IEEE International Conference on (Volume:2 ), pp.889-893
DOI:	10.1109/ICECS.2001.957616
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Proceeding

Files in This Item:

File	Description	Size	Format
0780370570_2p889-893.pdf		415Kb	Adobe PDF	665	View/Open
index.html		0Kb	HTML	284	View/Open