考虑绕障和拓扑结构的PCB布线算法研究

Research on PCB Routing Algorithms Considering Obstacle Avoidance and Topological Structure

在印刷电路板设计中,电路板的性能和制造成本受到布线算法的效率和质量的影响。为提高布线的效率和质量,本文提出了一种基于R树进行障碍识别和改进A^(*)算法进行布线的PCB布线算法。算法首先使用R树存储整个PCB板的障碍物信息,然后使用改进的A^(*)算法兼顾周围线网的拓扑结构进行布线,并在布线过程中动态更新R树,以高效获取布线路径与现有线路或元件的空间关系。实验的结果表明,本文的布线算法布线效率较高,布通率达到100%,能满足工业电路设计中时序匹配、线间距和135度布线等基本要求,且走线具有统一的拓扑结构。

In printed circuit board design,the performance and manufacturing cost of circuit boards are influenced by the efficiency and quality of wiring algorithms.To improve the efficiency and quality of wiring,this paper proposes a PCB wiring algorithm based on R-tree for obstacle recognition and improved A^(*)algorithm for wiring.The algorithm first uses an R-tree to store the obstacle information of the entire PCB board,and then uses an improved A^(*)algorithm to take into account the topological structure of the surrounding wire network for routing.During the routing process,the R-tree is dynamically updated to efficiently obtain the spatial relationship between the routing path and existing circuits or components.The experimental results show that the routing algorithm proposed in this paper has a high routing efficiency,with a pass rate of 100%.It can meet the basic requirements of timing matching,line spacing,and 135 degree routing in industrial circuit design,and the routing has a unified topology structure.