Design and Implementation of Integrated Circuit Routing Algorithm based on A-Star

With the rapid development of integrated circuits, the number of devices on a single chip has increased dramatically, posing significant challenges to integrated circuit design. Nowadays, the number and complexity of interconnections on chips have reached astonishing levels, making it impossible to rely solely on manual routing. Detailed routing is a critical step in the routing process, and its quality directly affects the performance of the chip. This paper presents an in-depth study of the detailed routing algorithm of integrated circuits based on the A-Star algorithm based on grid-based model. The grid-based routing model is modeled in MATLAB, and the A-Star algorithm is improved based on this model. The improved algorithm is successfully applied to solve simple two-terminal routing problems. Subsequently, the performance of several path search algorithms is simulated, analyzed, and compared in the grid-based model.