A Computational Approach for the Diagnosability of Dynamical Circuits
- 1 July 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 3 (3) , 165-171
- https://doi.org/10.1109/tcad.1984.1270071
Abstract
Based on a discrete-time circuit description, a necessary and sufficient condition is derived for the local diagnosability of the class of dynamical circuits whose branch relations are analytic functions of their arguments. Both the single-fault case and the case where all the parameters are assumed to be faulty are dealt with. The condition is a rank test on a matrix that is determined from a single circuit simulation and sensitivity computation. The technique is illustrated with an example.Keywords
This publication has 8 references indexed in Scilit:
- Diagnosability of Nonlinear Circuits and Systems—Part II: Dynamical SystemsIEEE Transactions on Computers, 1981
- Diagnosability of Nonlinear Circuits and Systems—Part I: The dc CaseIEEE Transactions on Computers, 1981
- A survey of optimization techniques for integrated-circuit designProceedings of the IEEE, 1981
- On the Periodic Steady-State Problem by the Newton MethodIEEE Transactions on Circuits and Systems, 1980
- Fault diagnosis for linear systems via multifrequency measurementsIEEE Transactions on Circuits and Systems, 1979
- Simplified ATPG and analog fault location via a clustering and separability techniqueIEEE Transactions on Circuits and Systems, 1979
- A theory and an algorithm for analog circuit fault diagnosisIEEE Transactions on Circuits and Systems, 1979
- The Sparse Tableau Approach to Network Analysis and DesignIEEE Transactions on Circuit Theory, 1971