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.

Jian-Ning Song

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

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

Systems, architecture and hardware · 1 · 1 first-author

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 › routing
channel routing
0.011988
Two-stage channel routing for CMOS gate arrays · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1988
Electronic design automation › physical design › routing › VLSI routing
gate array routing
0.011988
Two-stage channel routing for CMOS gate arrays · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1988
Electronic design automation
physical design
0.011988
Two-stage channel routing for CMOS gate arrays · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1988

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

multilevel prediction · 0.0greedy algorithm · 0.0
YearPublicationVenuePosition
1988 Two-stage channel routing for CMOS gate arrays
abstract
A two-stage channel routing technique for CMOS gate arrays is proposed. In the first stage, certain nets are routed on two sides of the channel so that channel density is reduced. A single-side O(N) optimum algorithm is presented for this stage. The algorithm can choose one set with maximum weight from among the possible sets of routing nets. The second stage can be general channel routing. An efficient algorithm for one-and-a-half-layer routing model that is based on one metal mask and a fixed poly-crossunder layer is presented. This router scans the channel in a left-to-right, zone-by-zone manner, using a multilevel prediction to guide wiring and a greedy approach for nets to contend for limited crossunders. Implementation results are provided to indicate the efficiency of the technique.>
Jian-Ning Song, Yun-Kang Chen
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1