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

Wei Li 0023

dblp:64/6025-23 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · conflict

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

Systems, architecture and hardware · 3 · 2 first-authorSoftware engineering, systems software and programming languages · 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
2 papers
Electronic design automation · 96% Energy-efficient computing · 4%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
test generation
0.122004
On test generation for transition faults with minimized peak power dissipation · DAC 2004
A scan BIST generation method using a markov source and partial bit-fixing · DAC 2003
Electronic design automation
hardware verification and test
0.012004
On test generation for transition faults with minimized peak power dissipation · DAC 2004
Electronic design automation › hardware verification and test › delay fault testing
transition fault testing
0.012004
On test generation for transition faults with minimized peak power dissipation · DAC 2004
Electronic design automation › hardware verification and test › design for testability
built-in self-test
0.012003
A scan BIST generation method using a markov source and partial bit-fixing · DAC 2003
Electronic design automation
hardware test
0.012003
A scan BIST generation method using a markov source and partial bit-fixing · DAC 2003
Electronic design automation › hardware verification and test › test generation › random test generation
pseudorandom test pattern generation
0.012003
A scan BIST generation method using a markov source and partial bit-fixing · DAC 2003
Electronic design automation › hardware verification and test › design for testability › built-in self-test
scan-based BIST
0.012003
A scan BIST generation method using a markov source and partial bit-fixing · DAC 2003
Energy-efficient computing
power management
0.012004
On test generation for transition faults with minimized peak power dissipation · DAC 2004

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

stuck-at fault test generation · 0.0state transition probability computation · 0.0partial bit-fixing · 0.0markov source · 0.0
YearPublicationVenuePosition
2004 On test generation for transition faults with minimized peak power dissipation
abstract
This paper presents a method of generating tests for transition faults using tests for stuck-at faults such that the peak power is the minimum possible using a given set of tests for stuck-at faults. The proposed method is suitable for use in testing scan designs that employ enhanced scan. The method reduces the peak power consumption in benchmark circuits by 19% on the average with essentially the same test set size and the same fault coverage compared to an earlier method.
Wei Li 0023, Sudhakar M. Reddy, Irith Pomeranz
DAC1
2003 A scan BIST generation method using a markov source and partial bit-fixing
abstract
Recently, Markov sources were shown to be effective in designing pseudo-random test pattern generators with low area overhead for built-in self-test of scan designs. This paper presents a new test pattern generation scheme based on a Markov source and a partial bit-fixing technique. A new method is proposed for the computation of the state transition probabilities of the Markov source based on the statistics of a deterministic test set. This is enhanced by partial bit-fixing logic, which fixes a group of consecutive inputs to all-0 or all-1. Experimental results show that the proposed BIST scheme can achieve 100% fault coverage for large benchmark circuits with reduced hardware overhead and reduced pattern counts compared to the earlier method using Markov sources.
Wei Li 0023, Chaowen Yu, Sudhakar M. Reddy, Irith Pomeranz
DAC1
2003 An Improved Markov Source Design for Scan BIST
abstract
Recently, Markov sources were shown to achieve 100% fault efficiency at low area overhead when used as pseudo-random pattern generators in scan BIST. In this paper we give a new method of designing Markov sources. The new design attempts to match probabilities of 1 to 0 and 0 to 1 transitions in consecutive bits of a set of test vectors, taking into account that the transition probabilities may be different for different bit positions. Experimental results show that the proposed method considerably reduces the hardware overhead and test lengths required to achieve 100% fault coverage.
Chaowen Yu, Wei Li 0023, Sudhakar M. Reddy, Irith Pomeranz
IOLTS2