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

Hsin-Po Wang 0002

dblp:75/329-2 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2008
0000-0003-2574-1510ORCID · corroborated

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

Systems, architecture and hardware · 4 · 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 › clock network synthesis
clock skew optimization
0.112008
Type-matching clock tree for zero skew clock gating · DAC 2008
Electronic design automation › physical design › clock network synthesis
clock tree synthesis
0.112008
Type-matching clock tree for zero skew clock gating · DAC 2008
Electronic design automation
physical design
0.112008
Type-matching clock tree for zero skew clock gating · DAC 2008

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

type-matching · 0.1clock gating · 0.1
YearPublicationVenuePosition
2008 Type-matching clock tree for zero skew clock gating
abstract
Clock skew minimization is always very important in the clock tree synthesis. Due to clock gating, the clock tree may include different types of logic gates, e.g., AND gates, OR gates, and buffer gates. If the logic gates at the same level are in different types, which have different timing behaviors, the control of clock skew becomes difficult. Based on that observation, in this paper, we present a novel clock tree design style, called type-matching clock tree, to ensure that the logic gates at the same level are in the same type. We prove that any clock control logic can always be transformed to our type-matching clock tree. Then, based on the idea of type-matching clock tree, we propose a zero skew gated clock tree synthesis algorithm. Compared with the industry-strength gated clock tree synthesis, experimental data show that our approach can significantly reduce the clock skew in every process corner with a small penalty on the clock tree area and the clock tree power consumption.
Chia-Ming Chang 0002, Shih-Hsu Huang, Yuan-Kai Ho, Jia-Zong Lin, Hsin-Po Wang 0002, Yu-Sheng Lu
DAC5
2001 A Built-in Self-Test and Self-Diagnosis Scheme for Heterogeneous SRAM Clusters
abstract
Testing and diagnosis are important issues in system-on-chip (SoC) development, as more and more embedded cores are being integrated into the chips. In this paper we propose a built-in self-test (BIST) and self-diagnosis (BISD) scheme for embedded SRAMs, suitable for SoC applications. It supports manufacturing test as well as diagnosis for design verification and yield improvement. With low hardware cost, our memory BISD approach can handle various types of SRAM, including pipelined, multi-port, and multi-clock architectures. In addition, a test scheduling methodology and a BISD compiler are also implemented, which reduce the testing time as well as test development time.
Chih-Wea Wang, Ruey-Shing Tzeng, Chi-Feng Wu, Chih-Tsun Huang, Cheng-Wen Wu, Shi-Yu Huang, Shyh-Horng Lin, Hsin-Po Wang 0002
Asian Test Symposium8
2001 A Flexible Logic BIST Scheme and Its Application to SoC Designs
abstract
Built-in self-test for logic circuits or logic BIST is an effective solution for the test cost, test quality, and test reuse problems. Logic BIST implements most ATE functions on chip so that the test cost can be reduced through less test time, less tester memory requirement, or a cheaper tester. Logic BIST applies a large number of test patterns so that more defects, either modeled or un-modeled, can be detected. In addition, logic BIST makes it easy to conduct the at-speed test for detecting timing-related defects. Furthermore, a BISTed- core makes SoC testing easier. Most of logic BIST schemes are based on the STUMPS structure, which applies random patterns generated by a PRPG to a full-scan circuit in parallel and compresses the responses into a signature with a MISR. The basic BIST flow includes initialization and a shift-capture loop. Logic BIST schemes are difficult to implement due to (1) potential timing violations at the borders from a PRPG to scan chains and from scan chains to a MISR, (2) potential timing problems caused by inserting test points, especially control points, (3) potential destructive shift operations due to clock glitches, and (4) potential overtests due to false paths activated by at-speed transition generation. This paper summarizes a flexible logic BIST scheme that addresses the above problems.
Xiaoqing Wen, Hsin-Po Wang 0002
Asian Test Symposium2
2000 DFT and BIST techniques for the future
abstract
In this age of increasingly complex multi-million gate system-on-chip (SoC) device designs, coupled with multinational design and fabrication strategies to speed time to market for new products, new strategies are needed for insuring that new integrated circuit (IC) designs can be tested to very high levels of quality with very economical production test times.
Hsin-Po Wang 0002, Jon Turino
Asian Test Symposium1