摘要
提出了基于布线点阵的线探索优化算法,它继承了计算几何中无网格布线的优点,克服了计算几何算法中当器件排列繁杂时,其效率可能比传统的网格布线还要低的问题。首先采用布线点阵,减少探索的次数;然后运用死点避免方法保证算法的完备性,确保能够找到实际上存在的路径;另外还采用了路径优化方法减少了路径的拐点。最后,利用电路板测试结果展示平台仿真实验,获得了良好的布线结果和展示效果。
A line-exploring algorithm based on routing lattice routing direction code was proposed. It inherits the advantages of gridless routing in computational geometry, which conquers possible lower effective than traditional grid routing method when the array of device is complex. First of all, routing lattice was adopted to reduce exploring times, and then the completeness was combined by dead point-avoided to identify to find a realistic routes. Furthermore, the route optimization algorithm was utilized to reduce the inflection of the route. The results of emulation experiment of exhibiting platform show great effects in routing and layout.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2013年第3期514-518,共5页
Journal of System Simulation
基金
国家自然科学基金(61070124)
安徽省高等学校优秀青年人才基金项目(2010SQRL013ZD)
中央高校基本科研业务费专项资金项目(2010HGBZ0565
2010HGZY0001)
关键词
计算几何
布线点阵
线探索算法
无网格布线
computational geometry
routing lattice
line-exploring algorithm
gridless routing
