QQ客服 官方微博 反馈留言

	An incremental algorithm for non-slicing floorplan based on corner block list representation
	Yang Liu ; Ma Yuchun ; Hong Xianlong ; Dong Sheqin ; Zhou Qiang
	2010-05-06 ; 2010-05-06
关键词	Experimental/ algorithm theory integrated circuit layout/ nonslicing floorplan corner block list representation incremental floorplanning algorithm vertical adjacency graph horizontal adjacency graph critical path accumulated slack distances deleting modules adding modules resizing modules wire length performance guidelines/ B2570A Semiconductor integrated circuit design, layout, modelling and testing C7410D Electronic engineering computing
中文摘要	We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning results. Based on the critical path and the accumulated slack distances we define, we choose the best position for insertion and do a series of operations incrementally, such as deleting modules, adding modules, and resizing modules quickly. This incremental floorplanning algorithm has a very high speed less than 1 mu m, which is one of the most important measures in this research. The algorithm preserves the original good performances on area and wire length. It can also supply other tools with good physical estimates for area, wire length,and other performance guidelines.
语种	英语 ; 英语
出版者	Science Press ; China
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9899]
专题	清华大学
推荐引用方式 GB/T 7714	Yang Liu,Ma Yuchun,Hong Xianlong,et al. An incremental algorithm for non-slicing floorplan based on corner block list representation[J],2010, 2010.
APA	Yang Liu,Ma Yuchun,Hong Xianlong,Dong Sheqin,&Zhou Qiang.(2010).An incremental algorithm for non-slicing floorplan based on corner block list representation..
MLA	Yang Liu,et al."An incremental algorithm for non-slicing floorplan based on corner block list representation".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。