Algorithm to Generate Cumulative Contribution of Constant Elements to a Circuit Matrix in a General Purpose Computer-Aided Design Program
Original Publication Date: 1983-Oct-01
Included in the Prior Art Database: 2005-Feb-07
An algorithm is presented which reduces CPU time and store requirements in the simulation of large circuits. Ordinarily, for large circuits, the simulation time increases drastically. Certain steps require 2N operations, where N is the size of the circuit. Using the algorithm described below, the operation indicated increases linearly with the circuit size. CPU time reduces drastically for large circuits. Storage requirements also reduce. Mathematically, the problem can be stated as follows: Given a set, x, with arbitrary integers arranged in ascending order, and a corresponding set, y, of floating point numbers, with x having redundancy, i.e., x can be partitioned into disjoint subsets xk (k = 1, 2, = number of disjoint subsets).