A Weighted Directed Graph-based Algorithm for Group Routing in Printed Circuit Boards
-
摘要: 布线是印刷电路板设计中的重要一环.传统的布线研究多聚焦于总线布线，而没有将布线时确定的群组作为研究对象，由于未经总线分组，可能存在群组中线网较多的情况，从而给实际布线带来新的挑战.为此，本文提出一种基于带权有向图的群组布线算法，首先构建仅含有合并边以及它们之间邻接关系的Hanan网格图.接着，利用合并边信息构建带权有向图，完成对电路板上布线资源的表示.然后，使用一种具有多线避让功能的启发式搜索算法来进行布线规划.最后，通过将布线情况归类为数种可能的情况分别考虑，完成详细布线并得到群组布线的最终结果.实验结果表明，算法在已经测试过的工业界复杂例子上均能达到100%的布通率，并且不会违反所有工业印刷电路板基准用例的设计规则约束.Abstract: Routing is considered an essential component in the design of printed circuit boards. In traditional research, a primary focus is placed on bus routing, while the groups determined during the routing process are not treated as a research subject. This approach can result in groups with a high density of nets, posing new challenges for practical routing. In response to this, a group routing algorithm based on a weighted directed graph is proposed in this paper. A Hanan grid graph is constructed, containing only merged edges and their adjacent relationships. Following this, a weighted directed graph is developed using the merged edge information to represent the routing resources on the circuit board. For routing planning, a heuristic search algorithm equipped with multi-wire avoidance features is utilized. The routing situations are then classified into several potential scenarios, each considered separately, to accomplish detailed routing and obtain the final result of group routing. Results from experiments demonstrate that a 100% routability is consistently achieved by the algorithm on complex industrial examples that have been previously tested, and that the design rule constraints of all benchmark industrial printed circuit board cases are not violated.
-
Keywords:
- Electronic Design Automation /
- Weighted Directed Graph /
- Group Routing
-
计量
- 文章访问数: 2
- HTML全文浏览量: 0
- PDF下载量: 1
下载:
