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

Vincent Wei-Hao Hsiao

dblp:131/1804 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Systems, architecture and hardware · 3

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
3 papers
Integrated circuit design · 88% Electronic design automation · 12%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
analog layout
0.632017
Parasitic-Aware Common-Centroid Binary-Weighted Capacitor Layout Generation Integrating Placement, Routing, and Unit Capacitor Sizing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Parasitic-aware Sizing and Detailed Routing for Binary-weighted Capacitors in Charge-scaling DAC · DAC 2014
Common-Centroid Capacitor Layout Generation Considering Device Matching and Parasitic Minimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2013
Integrated circuit design › analog layout
common-centroid placement
0.422014
Parasitic-aware Sizing and Detailed Routing for Binary-weighted Capacitors in Charge-scaling DAC · DAC 2014
Common-Centroid Capacitor Layout Generation Considering Device Matching and Parasitic Minimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2013
Electronic design automation
physical design
0.212014
Parasitic-aware Sizing and Detailed Routing for Binary-weighted Capacitors in Charge-scaling DAC · DAC 2014
Integrated circuit design › analog and mixed-signal circuits › analog VLSI
capacitor matching
0.212013
Common-Centroid Capacitor Layout Generation Considering Device Matching and Parasitic Minimization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2013
Integrated circuit design › analog and mixed-signal circuits › data converters
digital-to-analog converter
0.112017
Parasitic-Aware Common-Centroid Binary-Weighted Capacitor Layout Generation Integrating Placement, Routing, and Unit Capacitor Sizing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Integrated circuit design
analog and mixed-signal circuits
0.112014
Parasitic-aware Sizing and Detailed Routing for Binary-weighted Capacitors in Charge-scaling DAC · DAC 2014
Integrated circuit design › analog and mixed-signal circuits › data converters
charge-scaling DAC
0.112014
Parasitic-aware Sizing and Detailed Routing for Binary-weighted Capacitors in Charge-scaling DAC · DAC 2014

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

unit capacitor sizing · 0.3placement and routing integration · 0.3parasitic matching · 0.2integer nonlinear programming · 0.2placement and routing co-optimization · 0.2distributed connected unit capacitor · 0.2
YearPublicationVenuePosition
2017 Parasitic-Aware Common-Centroid Binary-Weighted Capacitor Layout Generation Integrating Placement, Routing, and Unit Capacitor Sizing
abstract
Capacitor sizing is a crucial step when designing charge-scaling digital-to-analog converters (DACs). Larger capacitor size can achieve better circuit accuracy and performance due to less impact from process gradient, parasitic mismatch, and local variation. However, it also results in larger chip area and higher power consumption. The size of binary-weighted capacitors in charge-scaling DACs is highly sensitive to the routing parasitics. Unmatched routing parasitics among binary-weighted capacitors will lead to large capacitor size for satisfying circuit accuracy and performance. Previous work focuses on the study of generating high-quality common-centroid placement of unit capacitor arrays while ignoring routing parasitics. None of them address the sizing of binary-weighed capacitors. This paper presents the first problem formulation in the literature which simultaneously considers capacitor sizing and parasitic matching during common-centroid capacitor layout generation such that the power consumption is minimized while the circuit accuracy/performance is also satisfied. Experimental results show that the proposed approach can achieve very significant chip area and power reductions compared with the state-of-the-art approaches.
Mark Po-Hung Lin, Vincent Wei-Hao Hsiao, Nai-Chen Chen
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2014 Parasitic-aware Sizing and Detailed Routing for Binary-weighted Capacitors in Charge-scaling DAC
abstract
Capacitor sizing is a crucial step when designing a charge-scaling digital-to-analog converter. Larger capacitor size can achieve better circuit accuracy and performance due to less impact from random, systematic, and parasitic mismatch. However, it also results in much larger chip area and even more power consumption. In addition to minimizing random and systematic mismatch during common-centroid capacitor placement, this paper presents the first problem formulation in the literature which simultaneously considers capacitor sizing and parasitic matching during common-centroid capacitor layout generation such that the power consumption is minimized while the circuit accuracy/performance is also satisfied. Experimental results show that the proposed approach can achieve very significant chip area and power reductions compared with the state of the art.
Mark Po-Hung Lin, Vincent Wei-Hao Hsiao
DAC2
2013 Common-Centroid Capacitor Layout Generation Considering Device Matching and Parasitic Minimization
abstract
In analog layout design, the accuracy of capacitance ratios correlates closely with both the matching properties among the ratioed capacitors and the induced parasitics due to interconnecting wires. However, most of the previous works only emphasized the matching properties of a common-centroid placement, but ignored the induced parasitics after it is routed. This paper addresses the parasitic issue in addition to device matching during common-centroid capacitor layout generation. To effectively minimize the routing-induced parasitics, a novel common-centroid placement style, distributed connected unit capacitors, is presented. Based on the placement style, the ratioed capacitor layout generation flow and algorithms are proposed to simultaneously optimize the matching properties of a common-centroid placement and minimize the induced parasitics. Experimental results show that the proposed approach can greatly reduce area, wirelength, and routing-induced parasitics, and guarantee the best matching quality after routing.
Mark Po-Hung Lin, Yi-Ting He, Vincent Wei-Hao Hsiao, Rong-Guey Chang, Shuenn-Yuh Lee
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3