A fast algorithm for the generation of fault dictionary of linear analog circuits using adjoint network approach

A method for the generation of a fault dictionary of a linear analog circuit is presented. The method is based on the well-known adjoined network concept. For an (n+1) node network and for an order of n/sup 2/ faults, the method is of O(n/sup 3/) time complexity. A minimum of O(n/sup 4/) is required, showing that the method is extremely fast. Using n processors, the method takes O(1) time on a single instruction multiple-data shared memory parallel computer.<
>