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

Huai-Yan Shiu

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

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

Systems, architecture and hardware · 1

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
hardware verification and test
0.112009
Scan-Chain Partition for High Test-Data Compressibility and Low Shift Power Under Routing Constraint · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2009
Electronic design automation › hardware verification and test › design for testability
scan chain design
0.112009
Scan-Chain Partition for High Test-Data Compressibility and Low Shift Power Under Routing Constraint · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2009
Electronic design automation › hardware verification and test
test data compression
0.112009
Scan-Chain Partition for High Test-Data Compressibility and Low Shift Power Under Routing Constraint · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2009

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

signal probability analysis · 0.1entropy analysis · 0.1
YearPublicationVenuePosition
2009 Scan-Chain Partition for High Test-Data Compressibility and Low Shift Power Under Routing Constraint
abstract
The degree of achievable test-data compression depends on not only the compression scheme but also the structure of the applied test data. Therefore, it is possible to improve the compression rate of a given test set by carefully organizing the way that test data are present in the scan structure. The relationship between signal probability and test-data entropy is explored in this paper, and the results show that the theoretical maximum compression can be increased through a partition of scan flip-flops such that the test data present in each partition have a skewed signal distribution. In essence, this approach simply puts similar scan flip-flops in an adjacent part of a scan chain, which also helps to reduce shift power in the scan test process. Furthermore, it is shown that the intrapartition scan-chain order has little impact on the compressibility of a test set; thus, it is easy to achieve higher test compression with low routing overhead. Experimental results show that the proposed partition method can raise the compression rates of various compression schemes by more than 17%, and the average reduction in shift power is about 50%. In contrast, the increase in routing length is limited.
Sying-Jyan Wang, Katherine Shu-Min Li, Shih-Cheng Chen, Huai-Yan Shiu, Yun-Lung Chu
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4