%0 Journal Article
%T Better Initial Placement Algorithm for Large-Scale Mixed-Mode Detailed Placement<br>大规模混合模式初始详细布局算法(英文)
%A Zhou Qiang
%A Luo Lijuan
%A Hong Xianlong
%A Zhou Hanbin
%A <br>周强
%A 罗丽娟
%A 洪先龙
%A 周汉斌
%J 半导体学报
%D 2004
%I 
%X An algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells IC design.Due to the limitation of computing complexity,an effective and efficient initial placement is very important for detailed placement.Novelty of this algorithm lies in a better solution at initial stage by using network flow method to satisfy row capacity constraint and the thought of linear placement problem(LPP) to resolve overlaps.Moreover,divide and conquer strategy and other simplified methods are adopted to minimize complexity.Experimental results show that the algorithm can get an average of 16% wire length improvement on PAFLO in reasonable CPU time.
%K placement
%K detailed placement
%K mixed
%K mode placement
%K algorithm<br>布局
%K 详细布局
%K 混合模式布局
%K 算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=025C8057C4D37C4BA0041DC7DE7C758F&aid=A2983A689B7F8702&yid=D0E58B75BFD8E51C&vid=C5154311167311FE&iid=DF92D298D3FF1E6E&sid=141C24EC1980F602&eid=7B927C26AC9ED104&journal_id=1674-4926&journal_name=半导体学报&referenced_num=0&reference_num=13