Dismiss
The Prior Art Database and Publishing service will be updated on Sunday, February 25th, from 1-3pm ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

# Algorithm to Generate Cumulative Contribution of Constant Elements to a Circuit Matrix in a General Purpose Computer-Aided Design Program

IP.com Disclosure Number: IPCOM000047204D
Original Publication Date: 1983-Oct-01
Included in the Prior Art Database: 2005-Feb-07
Document File: 2 page(s) / 22K

IBM

Zein, DA: AUTHOR

## Abstract

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).

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

Algorithm to Generate Cumulative Contribution of Constant Elements to a Circuit Matrix in a General Purpose Computer-Aided Design Program

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).

(Image Omitted)

The above problem occurred in the IBM APL Interactive Circuit Design Program, where x is a vector consisting of locations of constant contribution to the circuit matrix, and y is the value of these locations. The program was generating x and y with the order of operations being 0(2n-) and storage requirement of 0(2n-) floating-point words, where n is the length of x or y. The algorithm described here generates x-,y-in 0(2n) operations and 0(2) words of storage. The Algorithm

(Image Omitted)

1

Page 2 of 2

2