福建电脑2024，Vol.40Issue(7)：1-8,8.DOI:10.16707/j.cnki.fjpc.2024.07.001
考虑绕障和拓扑结构的PCB布线算法研究
Research on PCB Routing Algorithms Considering Obstacle Avoidance and Topological Structure
摘要
Abstract
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.关键词
R树/A*算法/PCB布线/区域布线Key words
R-Tree/A* Algorithm/PCB Routing/Bus Routing分类
信息技术与安全科学引用本文复制引用
袁豪,郑淦文..考虑绕障和拓扑结构的PCB布线算法研究[J].福建电脑,2024,40(7):1-8,8.基金项目
本文得到闽都创新实验室基金(No.2021ZR142)资助. （No.2021ZR142）
