Grouping Strategy-Based Proximity Obstacle-Avoidance Bus Routing

With the rapid development in the field of integrated circuit (IC) design, the demand for high-performance and high-density circuit designs continues to grow. Consequently, the importance of Bus automatic routing technology in improving PCB design efficiency is increasingly emphasized. Traditional Bus routing methods often fail to effectively handle obstacles during the routing process, leading to wastage of routing resources and an increase in wire length. As a result, this study proposes a barrier-aware Bus automatic routing algorithm based on grouping strategies (Grouped Bus Routing, GBR). At first, we perform grouping sequencing on the Bus based on the positional relationship between the Bus and obstacles (Grouping Seqencing). Then, it conducts routing by following the contour positions of obstacles (Obstacle-Conforming Routing). The experimental results demonstrate that this algorithm can optimize the wire length for Bus automatic routing around obstacles, improve the efficiency of Bus automatic routing, and enhance the utilization of routing space resources. Especially in densely packed routing spaces, it shows high efficiency and feasibility.