The proposed algorithm enhances routing path length and CPU time for ordered escape routing, suggesting better efficiency in circuit design.
The ordered escape routing of the differential pair represents a critical component in the physical design of the printed circuit board. An improved Monte Carlo Tree Search (MCTS) algorithm and an innovative technique for estimating escape points are proposed to address the problem of satisfying the constraint of ordered escape routing. Compared with the existing method, the proposed method demonstrates a significant improvement in routing path length and CPU time, both for grid pin arrays and staggered pin arrays. Moreover, the proposed approach effectively addresses the blockage-avoided ordered escape routing problem for differential pairs.
No takes yet. Share an insight, caveat, or question.
Deng et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: