Ordered Substrate Routing for High-Density Packaging Combining Improved Astar Algorithm

The substrate routing in high-density packaging boards is the physical connection foundation for various components. Optimizing substrate routing methods and technologies significantly enhances the performance and reliability of chips. Previous works have proposed numerous substrate routing algorithms. However, due to the discrepancies between actual routing results and expectations, manual adjustments are frequently necessary, coupled with prolonged routing times, which extend the design cycle. Therefore, in this paper, we propose a high-density packaging substrate routing algorithm based on ordered detailed routing. By pre-routing grouping of interconnections and order planning, as well as optimizing the Astar search algorithm, this paper aims to enhance overall routing capability and accelerate routing speed. The experimental results show that compared to Wen's routing algorithm, the proposed routing algorithm reduces the average wirelength by 1.1 % and routing time by 13.7% while maintaining the routability.

Authors

Institutions

Publication Details

Published
2025-02-28
DOI
https://doi.org/10.1109/iccece65250.2025.10985418
Primary Topic
3D IC and TSV technologies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ordered Substrate Routing for High-Density Packaging Combining Improved Astar Algorithm

Haoying Wu, Xiao Jiang
3D IC and TSV technologies
article

Ordered Substrate Routing for High-Density Packaging Combining Improved Astar Algorithm

Haoying Wu, Xiao Jiang
article en

Abstract

The substrate routing in high-density packaging boards is the physical connection foundation for various components. Optimizing substrate routing methods and technologies significantly enhances the performance and reliability of chips. Previous works have proposed numerous substrate routing algorithms. However, due to the discrepancies between actual routing results and expectations, manual adjustments are frequently necessary, coupled with prolonged routing times, which extend the design cycle. Therefore, in this paper, we propose a high-density packaging substrate routing algorithm based on ordered detailed routing. By pre-routing grouping of interconnections and order planning, as well as optimizing the Astar search algorithm, this paper aims to enhance overall routing capability and accelerate routing speed. The experimental results show that compared to Wen's routing algorithm, the proposed routing algorithm reduces the average wirelength by 1.1 % and routing time by 13.7% while maintaining the routability.

Wuhan University of Technology (CN)
Affordable and clean energy
Openalex Percentile: Top 91%
3D IC and TSV technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.