Analog network testability measurement: a symbolic formulation approach

A symbolic formulation approach is applied to the problem of computing testability features of analog linear networks. The program, SAPTES, obtained by following this approach is presented. The program can be a very useful tool for designers and researchers in the field of linear analog circuits. SAPTES, which is written in LISP and runs on MS-DOS personal computers, is able to compute the testability of linear circuits of rather high complexity (composed of tens of components and nodes). Computational times range from a few tens of seconds to some tens of minutes on medium speed computers. The program is easily transportable to workstations or a mainframe, and, for the mainframe, program performance will considerably increase. >

[1]  R. Berkowitz.  Conditions for Network-Element-Value Solvability , 1962 .

[2]  W. J. Dejka.  A review of measures of testability for analog systems , 1977 .

[3]  Neeraj Sen.  A measure of testability and its application to test point selection , 1977 .

[4]  R Saeks,et al.  Fault Analysis in Electronic Circuits and Systems. II. , 1978 .

[5]  R. Saeks,et al.  A search algorithm for the solution of the multifrequency fault diagnosis equations , 1979 .

[6]  Neeraj Sen,et al.  Fault diagnosis for linear systems via multifrequency measurements , 1979 .

[7]  R. Priester,et al.  New measures of testability and test complexity for linear analog failure analysis , 1981 .

[8]  J.W. Bandler,et al.  Fault diagnosis of analog circuits , 1985, Proceedings of the IEEE.

[9]  S. Manetti,et al.  Multifrequency measurement of testability with application to large linear analog systems , 1986 .

[10]  S. Manetti,et al.  Improvements to numerical testability evaluation , 1987, IEEE Transactions on Instrumentation and Measurement.

[11]  Gerard N. Stenbakken,et al.  Test-point selection and testability measures via QR factorization of linear models , 1987, IEEE Transactions on Instrumentation and Measurement.

[12]  M. Bon,et al.  Automated design software for switched-capacitor IC's with symbolic simulator SCYMBAL , 1988, DAC '88.

[13]  M.G.R. Degrauwe,et al.  A symbolic analysis tool for analog circuit design automation , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[14]  Stefano Manetti,et al.  SAPEC-a personal computer program for the symbolic analysis of electric circuits , 1988, 1988., IEEE International Symposium on Circuits and Systems.

[15]  Georges Gielen,et al.  ISAAC: a symbolic simulator for analog integrated circuits , 1989, IEEE J. Solid State Circuits.

[16]  Georges Gielen,et al.  Symbolic simulation of analog circuits in S- and Z-domain , 1989, IEEE International Symposium on Circuits and Systems,.

[17]  Janusz A. Starzyk,et al.  Tolerances in symbolic network analysis , 1989, IEEE International Symposium on Circuits and Systems,.

[18]  Stefano Manetti,et al.  Network sensitivity analysis via symbolic formulation , 1989, IEEE International Symposium on Circuits and Systems,.

[19]  G. Stenbakken,et al.  Ambiguity groups and testability , 1989 .

[20]  A. Konczykowska,et al.  Symbolic simulation for efficient repetitive analysis and artificial intelligence techniques in CAD , 1989, IEEE International Symposium on Circuits and Systems,.

[21]  P. M. Lin,et al.  A new network approach to symbolic simulation of large-scale networks , 1989, IEEE International Symposium on Circuits and Systems,.

[22]  Stefano Manetti,et al.  New approach to automatic symbolic analysis of electric circuits , 1991 .

[23]  L. P. Huelsman,et al.  A computational approach to the development and reduction of large symbolic expressions , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[24]  J.L. Huertas,et al.  An advanced symbolic analyzer for the automatic generation of analog circuit design equations , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.