A Path-Based Timing-Driven Quadratic Placement Algorith
ASPDAC（2003）
摘要
This paper presents a path-based timing-driven quadratic placement algorithm. The delay of the path acts as the timing constraints. In the global optimization step, it tries to satisfy the timing constraints. In the partition step, it tries to decrease the cut number of critical paths. It has some special skills, such as decrease the delay on the longest path, pad assign, to decrease the delay further. Results show this algorithm can make the timing behavior improve more than 20%.
更多查看译文
关键词
circuit optimisation,integrated circuit layout,quadratic programming,timing,critical path number reduction,global optimization,longest path delay reduction,pad assignment,partition step,path delay,path-based placement algorithm,quadratic placement,timing constraints,timing-driven placement,
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要