Routability-driven ordered escape routing method based on neural network

This study presents an innovative approach that utilizes neural network-based techniques to address the Ordered Escape Routing (OER) problem. The OER problem holds a crucial position in integrated circuit design, requiring multiple pins to be connected to the boundary of a chip in a specific order while ensuring that the routing paths do not cross. Additionally, the total wire length must be minimized during the process. To tackle this challenging problem, we propose a novel routability-driven method that leverages neural networks (NN) to predict feasible routing paths that satisfy the required conditions. This approach not only ensures non-crossing paths but also strictly adheres to the specified pin connection order, while further minimizing the total wire length under these constraints. The core of this technique lies in the efficient predictive capabilities of neural networks.

Authors

Institutions

Publication Details

Published
2025-02-05
DOI
https://doi.org/10.1117/12.3057983
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Routability-driven ordered escape routing method based on neural network

Dingyi Cheng, Hui‐Chin Yeh
Advanced Algorithms and Applications
article

Routability-driven ordered escape routing method based on neural network

Dingyi Cheng, Hui‐Chin Yeh
article en

Abstract

This study presents an innovative approach that utilizes neural network-based techniques to address the Ordered Escape Routing (OER) problem. The OER problem holds a crucial position in integrated circuit design, requiring multiple pins to be connected to the boundary of a chip in a specific order while ensuring that the routing paths do not cross. Additionally, the total wire length must be minimized during the process. To tackle this challenging problem, we propose a novel routability-driven method that leverages neural networks (NN) to predict feasible routing paths that satisfy the required conditions. This approach not only ensures non-crossing paths but also strictly adheres to the specified pin connection order, while further minimizing the total wire length under these constraints. The core of this technique lies in the efficient predictive capabilities of neural networks.

National Yunlin University of Science and Technology (TW)
Openalex Percentile: Top 98%
Advanced Algorithms and Applications
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.