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

Lumdo Chen

dblp:05/603 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Systems, architecture and hardware · 4

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
4 papers
Electronic design automation · 99% Integrated circuit design · 1%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
design for manufacturability
0.222010
Accurate and Analytical Statistical Spatial Correlation Modeling Based on Singular Value Decomposition for VLSI DFM Applications · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010
Accurate and analytical statistical spatial correlation modeling for VLSI DFM applications · DAC 2008
Electronic design automation › design for manufacturability
spatial correlation modeling
0.222010
Accurate and Analytical Statistical Spatial Correlation Modeling Based on Singular Value Decomposition for VLSI DFM Applications · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010
Accurate and analytical statistical spatial correlation modeling for VLSI DFM applications · DAC 2008
Electronic design automation
physical design
0.122008
Full-Chip Routing Considering Double-Via Insertion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Novel full-chip gridless routing considering double-via insertion · DAC 2006
Electronic design automation › design for manufacturability
redundant via insertion
0.122008
Full-Chip Routing Considering Double-Via Insertion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Novel full-chip gridless routing considering double-via insertion · DAC 2006
Electronic design automation › physical design
routing
0.122008
Full-Chip Routing Considering Double-Via Insertion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Novel full-chip gridless routing considering double-via insertion · DAC 2006
Electronic design automation › timing analysis › statistical timing analysis
statistical timing and yield analysis
0.112010
Accurate and Analytical Statistical Spatial Correlation Modeling Based on Singular Value Decomposition for VLSI DFM Applications · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2010
Electronic design automation › design for manufacturability › design for yield
yield enhancement
0.122008
Novel full-chip gridless routing considering double-via insertion · DAC 2006
Full-Chip Routing Considering Double-Via Insertion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Electronic design automation › physical design › routing
detailed routing
0.112008
Full-Chip Routing Considering Double-Via Insertion · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2008
Electronic design automation › timing analysis
statistical timing analysis
0.112008
Accurate and analytical statistical spatial correlation modeling for VLSI DFM applications · DAC 2008
Electronic design automation › physical design › routing
double via insertion
0.112006
Novel full-chip gridless routing considering double-via insertion · DAC 2006
Electronic design automation › physical design › routing › detailed routing
gridless routing
0.112006
Novel full-chip gridless routing considering double-via insertion · DAC 2006

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

singular value decomposition · 0.2polynomial modeling · 0.1maze routing · 0.1graph matching · 0.1two-pass bottom-up routing · 0.1lagrangian relaxation · 0.1bipartite graph matching · 0.1
YearPublicationVenuePosition
2010 Accurate and Analytical Statistical Spatial Correlation Modeling Based on Singular Value Decomposition for VLSI DFM Applications
abstract
With the significant advancement of statistical timing and yield analysis algorithms, there is a strong need for accurate and analytical spatial correlation models. In this paper, we propose a novel spatial correlation modeling method that can not only capture the general spatial correlation relationship but also can generate highly accurate and analytical models. Our method, based on singular value decomposition, can generate sequences of polynomial weighted by the singular values. Experimental results from foundry measurement data show that our proposed approach is 3x accuracy improvement over several distance based spatial correlation modeling methods.
Jui-Hsiang Liu, Ming-Feng Tsai, Lumdo Chen, Charlie Chung-Ping Chen
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
2008 Accurate and analytical statistical spatial correlation modeling for VLSI DFM applications
abstract
With the significant advancement of statistical timing and yield analysis algorithms, there is a strong need for accurate and analytical spatial correlation models. In this paper, we propose a novel spatial correlation modeling method not only can capture the general spatial correlation relationship but also can generate highly accurate and analytical models. Our method, based on Singular Value Decomposition (SVD), can generate sequences of polynomial weighted by the singular values. Experimental results from foundry measurement data show that our proposed approach is 5X accuracy improvement over several distance based spatial correlation modeling methods.
Jui-Hsiang Liu, Ming-Feng Tsai, Lumdo Chen, Charlie Chung-Ping Chen
DAC3
2008 Full-Chip Routing Considering Double-Via Insertion
abstract
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures due to the copper cladding process. To improve via yield and reliability, redundant-via insertion is a highly recommended technique proposed by foundries. Traditionally, double-via insertion is performed at the postlayout stage. The increasing design complexity, however, leaves very limited space for postlayout optimization. It is thus desirable to consider the double-via insertion at both the routing and postrouting stages. In this paper, we present a new full-chip gridless routing system considering double-via insertion for yield enhancement. To fully consider double vias, the router applies a novel two-pass, bottom-up routability-driven routing framework and features a new redundant-via aware detailed maze routing algorithm (which could be applied to both gridless and grid-based routing). We also propose a graph-matching based post-layout double-via insertion algorithm to achieve a higher insertion rate. In particular, the algorithm is optimal for grid-based routing with up to three routing layers and the stacked-via structure. Experiments show that our methods significantly improve the via count, number of dead vias, double-via insertion rates, and running times.
Huang-Yu Chen, Mei-Fang Chiang, Yao-Wen Chang, Lumdo Chen, Brian Han
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4
2006 Novel full-chip gridless routing considering double-via insertion
abstract
As the technology node advances into the nanometer era, via-open defects are one of the dominant failures. To improve via yield and reliability, redundant-via insertion is a highly recommended technique proposed by foundries. Traditionally, double-via insertion is performed at the post-layout stage. The increasing design complexity, however, leaves very limited space for post-layout optimization. It is thus desirable to consider the double-via insertion at both routing and post-routing stages. In this paper, we present a new full-chip gridless routing system considering double-via insertion for yield enhancement. To fully consider double vias, the router applies a novel two-pass, bottom-up routability-driven routing framework. We also propose a new post-layout double-via insertion algorithm to achieve a higher insertion rate. Based on a bipartite graph matching formulation, we develop an optimal double-via insertion algorithm for the cases with up to three routing layers and the stack-via structure, and then extend the algorithm to handle the general cases. Experiments show that our methods significantly improve the via count, the number of dead vias, double-via insertion rates, and running times.
Huang-Yu Chen, Mei-Fang Chiang, Yao-Wen Chang, Lumdo Chen, Brian Han
DAC4