SER-NET: A Neuralize PCB Simulataneous Escape Routing Method Using Deep Reinforcement Learning

Simultaneous escape routing is a challenging issue in PCB routing, as it involves the escape of pins within two integrated circuits (ICs) to boundaries under limited resources and net order constraints. With advancements in IC fabrication technologies, there has been an increase in the number of pins in ICs and a reduction in package size, further complicating the simultaneous escape problem in printed circuit boards (PCBs). Our approach addresses this problem by dividing it into two stages: escape endpoint assignment and end-to-end routing. We utilize graphical convolutional neural networks and attention-based networks to create policy and value models for specifying escape endpoints. These models learn PCB layouts and nets representations to replace human decision-making and evaluation. Through near-end policy optimization, we update the model parameters. We then apply the model outputs to a congestion negotiation-based router to enhance the quality of simultaneous escape routing. Our method consistently achieves 100% routability in all cases, outperforming other routers that can only complete routing for a portion of the problem.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/icicm63644.2024.10814469
Primary Topic
VLSI and FPGA Design Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SER-NET: A Neuralize PCB Simulataneous Escape Routing Method Using Deep Reinforcement Learning

Qingjia Chi, Tianyi Li, Ning Xu, Hao Cai et al.
VLSI and FPGA Design Techniques
article

SER-NET: A Neuralize PCB Simulataneous Escape Routing Method Using Deep Reinforcement Learning

Qingjia Chi, Tianyi Li, Ning Xu, Hao Cai, Hongyuan Wang
article en

Abstract

Simultaneous escape routing is a challenging issue in PCB routing, as it involves the escape of pins within two integrated circuits (ICs) to boundaries under limited resources and net order constraints. With advancements in IC fabrication technologies, there has been an increase in the number of pins in ICs and a reduction in package size, further complicating the simultaneous escape problem in printed circuit boards (PCBs). Our approach addresses this problem by dividing it into two stages: escape endpoint assignment and end-to-end routing. We utilize graphical convolutional neural networks and attention-based networks to create policy and value models for specifying escape endpoints. These models learn PCB layouts and nets representations to replace human decision-making and evaluation. Through near-end policy optimization, we update the model parameters. We then apply the model outputs to a congestion negotiation-based router to enhance the quality of simultaneous escape routing. Our method consistently achieves 100% routability in all cases, outperforming other routers that can only complete routing for a portion of the problem.

Wuhan University of Technology (CN), Wuhan Textile University (CN)
Openalex Percentile: Top 77%
VLSI and FPGA Design Techniques
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.