Demo Data from EDBT 2026 / reviewers in the wild / expert
Beena Vasudevan
dblp:69/5581
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › hardware verification and test › design for testability
built-in self-test |
0.0 | 1 | 1995 | Built-in self test for C-testable ILA's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995 |
Electronic design automation › hardware verification and test › testability improvement
c-testability |
0.0 | 1 | 1995 | Built-in self test for C-testable ILA's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995 |
Electronic design automation
hardware verification and test |
0.0 | 1 | 1995 | Built-in self test for C-testable ILA's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995 |
Electronic design automation › hardware verification and test › combinational circuit testing
iterative logic array testing |
0.0 | 1 | 1995 | Built-in self test for C-testable ILA's · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1995 |
Methods — techniques the papers use, named apart from their topics
one repetition length · 0.0linear finite state machine · 0.0distinguishing sequence · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Built-in self test for C-testable ILA'sabstractTesting of one-dimensional (1-D) unilateral iterative logic arrays (ILA's) of combinational cells with constant test vectors is studied and the concept of one repetition length (ORL) within the tests used for testing C-testable arrays is described. The impact of ORL on the test set size and the design of the test generator are discussed. ORL can dramatically reduce the on-chip test generator size with a negligible increase in the test set size. ORL, coupled with a single distinguishing sequence (DS) for ILA's with cell vertical outputs has proved to be attractive in terms of both reduced test set size and reduced test generator size. ORL testability can be used for C-testable arrays with single faulty cell and multiple faulty cells. The technique for using a single linear finite state machine (LFSM) for generating the necessary deterministic test patterns followed optionally by pseudorandom patterns from the same automaton is discussed. Use of an LFSM as a built-in test generator for only deterministic tests for 1-D ILA's is covered. With ORL, a compact LFSM based built-in self test (BIST) generator can deliver the test vectors to all the cells in the array. The exact probability distribution equation has been developed for additional bits needed to map a nonlinear machine (FSM) definition into a LFSM definition. The distribution clearly shows that the expected number of additional bits is very small, often zero.> Murali M. R. Gala, Don E. Ross, Karan L. Watson, Beena Vasudevan, Peter Utama |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 4 |
| 1993 | LFSR based deterministic hardware for at-speed BISTabstractA deterministic test pattern generator for BIST, based on linear feedback shift registers is discussed. A method of designing the test pattern generator in order that it generates deterministic as well as pseudo random patterns is presented. One application of this method is illustrated where deterministic at-speed testing of C-testable ILAs, covering all possible single and multiple combinational faults is achieved. Response analysers are discussed including one with zero aliasing probability. The algorithms for synthesizing the small amount of BIST hardware are explained.> Beena Vasudevan, Don E. Ross, Murali M. R. Gala, Karan L. Watson |
VTS | 1 |