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

James B. Clary

dblp:46/5959 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1981
—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 · 91% Integrated circuit design · 9%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
analog circuit testing
0.011981
New Measures of Testability and Test Complexity for Linear Analog Failure Analysis · IEEE Trans. Computers 1981
Electronic design automation
hardware verification and test
0.011981
New Measures of Testability and Test Complexity for Linear Analog Failure Analysis · IEEE Trans. Computers 1981
Electronic design automation › hardware verification and test › testability analysis
testability measure
0.011981
New Measures of Testability and Test Complexity for Linear Analog Failure Analysis · IEEE Trans. Computers 1981
Integrated circuit design › analog and mixed-signal circuits
analog circuit design
0.011981
New Measures of Testability and Test Complexity for Linear Analog Failure Analysis · IEEE Trans. Computers 1981

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

optimal experiment design · 0.0fisher information · 0.0cramer-rao bound · 0.0
YearPublicationVenuePosition
1981 New Measures of Testability and Test Complexity for Linear Analog Failure Analysis
abstract
The failure analysis of analog electronic systems is characterized by numerous, difficult problems. Assessing the testability and test complexity of a given system is one such problem. In fact, robust, quantitative measures of these important features have not been available to the analog testing community. This paper introduces new measures for both testability and test complexity which: 1) are quantitative, 2) are capable of handling multiple faults, and 3) have a well-defined interpretation. These measures are based upon published results from optimal experiment designs as developed in the discipline of systems identification. Parameter testability is defined in terms of information (in the sense of Fisher) return, while test complexity is functionally related to the experiment time required to achieve specified accuracy with regard to the uncertain parameters of interest. Thus both of the new measures introduced depend, not only upon the specific system at hand, but also upon the experimental conditions used in performing the tests. The results of this approach lead to quantitative measures that have optimality features based upon the Cramer–Rao bound.
Robert W. Priester, James B. Clary
IEEE Trans. Computers2