Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yolo Chen

dblp:305/9334 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.512021
A Complete PCB Routing Methodology with Concurrent Hierarchical Routing · DAC 2021
Electronic design automation › physical design › routing
printed circuit board routing
0.512021
A Complete PCB Routing Methodology with Concurrent Hierarchical Routing · DAC 2021
Electronic design automation › physical design › routing › printed circuit board routing
escape routing
0.112021
A Complete PCB Routing Methodology with Concurrent Hierarchical Routing · DAC 2021

Methods — techniques the papers use, named apart from their topics

simultaneous escape routing · 0.5length matching · 0.5gridless area routing · 0.5
YearPublicationVenuePosition
2021 A Complete PCB Routing Methodology with Concurrent Hierarchical Routing
abstract
Trends in high pin density and an increasing number of routing layers complicate printed circuit board (PCB) routing, which is categorized as escape and area routing. Traditional escape routing research has focused on escape routing but has not considered the quality of area routing among chip components at the same time. In this work, we propose a complete PCB routing methodology, including simultaneous escape routing (SER), post-SER refinement, and gridless area routing. The SER completes the layer assignment of all nets and produces an escape order ensuring suitable escape and area routing on each layer. Length-matching constraints and differential pair routing are satisfied in each stage of the routing flow. The experiment results indicate that the proposed PCB routing method can complete routings for seven commercial PCB designs, whereas the commercial PCB tool cannot complete any of them.
Shih-Ting Lin, Hung-Hsiao Wang, Chia-Yu Kuo, Yolo Chen, Yih-Lang Li
DAC4