A new symbolic approach for testability measurement of analog networks

A new approach for testability measurement of analog networks is presented. It is based on the use of symbolic techniques, that allow us to realize very simple testability evaluation algorithms. The new method presents noteworthy advantages from a computational point of view with respect to previous symbolic techniques of testability measurement developed by the authors in the past. In fact it does not require the computation of the sensitivities of the network functions, but it is based only on the study of the network function symbolic coefficients. A new theorem has been proved and the subsequent new algorithm permits to completely eliminate the roundoff errors and increase the computing speed. A brief introduction to the program which implements this new algorithm is also presented