ASTAP

Last updated

ASTAP (Advanced Statistical Analysis Program) [1] was a general purpose analog electronic circuit simulator developed primarily for in-house use by IBM from 1973 [2] on. It was a powerful program used for simulation of integrated circuit designs, and their analysis with statistical variations of the manufacturing process. In combination with the built-in Monte Carlo method capabilities it allowed prediction of the performance of electronic circuits under a wide range of material parameters and temperatures. ASTAP was designed to run on IBM Mainframe computers. Its algorithms were developed by IBM electrical engineers, especially Robert Brayton, Gary Hachtel, and Fred Gustavson.

Unlike SPICE, which used Modified nodal analysis (MNA) to form the system of circuit equations, ASTAP instead used sparse tableau approach [3] (STA) to construct and solve a sparse matrix. The sparse tableau formulation produced very large, very sparse matrices which required special techniques to solve efficiently, even at that time. The advantage of STA for statistical analysis is that, as originally outlined, a subsequent analysis of a circuit with randomly varied parameters only required changing entries in the matrix.

Related Research Articles

A hidden Markov model (HMM) is a statistical Markov model in which the system being modeled is assumed to be a Markov process — call it — with unobservable ("hidden") states. As part of the definition, HMM requires that there be an observable process whose outcomes are "influenced" by the outcomes of in a known way. Since cannot be observed directly, the goal is to learn about by observing HMM has an additional requirement that the outcome of at time must be "influenced" exclusively by the outcome of at and that the outcomes of and at must not affect the outcome of at

SPICE is a general-purpose, open-source analog electronic circuit simulator. It is a program used in integrated circuit and board-level design to check the integrity of circuit designs and to predict circuit behavior.

<span class="mw-page-title-main">Machine learning</span> Study of algorithms that improve automatically through experience

Machine learning (ML) is a field of inquiry devoted to understanding and building methods that 'learn', that is, methods that leverage data to improve performance on some set of tasks. It is seen as a part of artificial intelligence. Machine learning algorithms build a model based on sample data, known as training data, in order to make predictions or decisions without being explicitly programmed to do so. Machine learning algorithms are used in a wide variety of applications, such as in medicine, email filtering, speech recognition, agriculture, and computer vision, where it is difficult or unfeasible to develop conventional algorithms to perform the needed tasks. A subset of machine learning is closely related to computational statistics, which focuses on making predictions using computers, but not all machine learning is statistical learning. The study of mathematical optimization delivers methods, theory and application domains to the field of machine learning. Data mining is a related field of study, focusing on exploratory data analysis through unsupervised learning. Some implementations of machine learning use data and neural networks in a way that mimics the working of a biological brain. In its application across business problems, machine learning is also referred to as predictive analytics.

<span class="mw-page-title-main">Computational electromagnetics</span> Branch of physics

Computational electromagnetics (CEM), computational electrodynamics or electromagnetic modeling is the process of modeling the interaction of electromagnetic fields with physical objects and the environment.

Electromagnetic field solvers are specialized programs that solve Maxwell's equations directly. They form a part of the field of electronic design automation, or EDA, and are commonly used in the design of integrated circuits and printed circuit boards. They are used when a solution from first principles is needed, or the highest accuracy is required.

<span class="mw-page-title-main">Matching pursuit</span>

Matching pursuit (MP) is a sparse approximation algorithm which finds the "best matching" projections of multidimensional data onto the span of an over-complete dictionary . The basic idea is to approximately represent a signal from Hilbert space as a weighted sum of finitely many functions taken from . An approximation with atoms has the form

<span class="mw-page-title-main">Electronic circuit simulation</span>

Electronic circuit simulation uses mathematical models to replicate the behavior of an actual electronic device or circuit. Simulation software allows for modeling of circuit operation and is an invaluable analysis tool. Due to its highly accurate modeling capability, many colleges and universities use this type of software for the teaching of electronics technician and electronics engineering programs. Electronics simulation software engages its users by integrating them into the learning experience. These kinds of interactions actively engage learners to analyze, synthesize, organize, and evaluate content and result in learners constructing their own knowledge.

Compressed sensing is a signal processing technique for efficiently acquiring and reconstructing a signal, by finding solutions to underdetermined linear systems. This is based on the principle that, through optimization, the sparsity of a signal can be exploited to recover it from far fewer samples than required by the Nyquist–Shannon sampling theorem. There are two conditions under which recovery is possible. The first one is sparsity, which requires the signal to be sparse in some domain. The second one is incoherence, which is applied through the isometric property, which is sufficient for sparse signals.

Sparse approximation theory deals with sparse solutions for systems of linear equations. Techniques for finding these solutions and exploiting them in applications have found wide use in image processing, signal processing, machine learning, medical imaging, and more.

<span class="mw-page-title-main">Leon O. Chua</span> American electrical engineer and computer scientist

Leon Ong Chua is an American electrical engineer and computer scientist. He is a professor in the electrical engineering and computer sciences department at the University of California, Berkeley, which he joined in 1971. He has contributed to nonlinear circuit theory and cellular neural network theory.

In electrical engineering, modified nodal analysis or MNA is an extension of nodal analysis which not only determines the circuit's node voltages, but also some branch currents. Modified nodal analysis was developed as a formalism to mitigate the difficulty of representing voltage-defined components in nodal analysis. It is one such formalism. Others, such as sparse tableau formulation, are equally general and related via matrix transformations.

<span class="mw-page-title-main">Estimation of signal parameters via rotational invariance techniques</span>

In estimation theory, estimation of signal parameters via rotational invariant techniques (ESPRIT) is a technique to determine parameters of a mixture of sinusoids in a background noise. This technique is first proposed for frequency estimation, however, with the introduction of phased-array systems in daily use technology, it is also used for Angle of arrival estimations as well.

<span class="mw-page-title-main">Jacob K. White</span> American electronics engineer and professor

Jacob K. White is the Cecil H. Green Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. He researches fast numerical algorithms for simulation, particularly the simulation of circuits. His work on the FASTCAP program for three-dimensional capacitance calculation and FASTHENRY, a program for three-dimensional inductance calculations, is highly cited. He has also done extensive work on steady-state simulation of analog and microwave circuits. White was a significant early contributor to the development of Spectre and SpectreRF.

<span class="mw-page-title-main">Star-mesh transform</span> Mathematical circuit analysis technique

The star-mesh transform, or star-polygon transform, is a mathematical circuit analysis technique to transform a resistive network into an equivalent network with one less node. The equivalence follows from the Schur complement identity applied to the Kirchhoff matrix of the network.

The MOEA Framework is an open-source evolutionary computation library for Java that specializes in multi-objective optimization. It supports a variety of multiobjective evolutionary algorithms (MOEAs), including genetic algorithms, genetic programming, grammatical evolution, differential evolution, and particle swarm optimization. As a result, it has been used to conduct numerous comparative studies to assess the efficiency, reliability, and controllability of state-of-the-art MOEAs.

Robust Principal Component Analysis (RPCA) is a modification of the widely used statistical procedure of principal component analysis (PCA) which works well with respect to grossly corrupted observations. A number of different approaches exist for Robust PCA, including an idealized version of Robust PCA, which aims to recover a low-rank matrix L0 from highly corrupted measurements M = L0 +S0. This decomposition in low-rank and sparse matrices can be achieved by techniques such as Principal Component Pursuit method (PCP), Stable PCP, Quantized PCP, Block based PCP, and Local PCP. Then, optimization methods are used such as the Augmented Lagrange Multiplier Method (ALM), Alternating Direction Method (ADM), Fast Alternating Minimization (FAM), Iteratively Reweighted Least Squares (IRLS ) or alternating projections (AP).

<span class="mw-page-title-main">Sparse dictionary learning</span> Representation learning method

Sparse coding is a representation learning method which aims at finding a sparse representation of the input data in the form of a linear combination of basic elements as well as those basic elements themselves. These elements are called atoms and they compose a dictionary. Atoms in the dictionary are not required to be orthogonal, and they may be an over-complete spanning set. This problem setup also allows the dimensionality of the signals being represented to be higher than the one of the signals being observed. The above two properties lead to having seemingly redundant atoms that allow multiple representations of the same signal but also provide an improvement in sparsity and flexibility of the representation.

This is a comparison of statistical analysis software that allows doing inference with Gaussian processes often using approximations.

<span class="mw-page-title-main">Mario A. T. Figueiredo</span> Portuguese engineer, academic

Mário A. T. Figueiredo is a Portuguese engineer, academic, and researcher. He is an IST Distinguished Professor and holds the Feedzai chair of machine learning at IST, University of Lisbon.

Wai-Kai Chen is a Chinese-American professor emeritus of electrical engineering and computer science.

References

  1. "ASTAP -- Advanced statistical analysis program," IBM Program Product Document SH20-1118-0, IBM Data Processing Div., White Plains, NY, 1973
  2. Weeks, W.; Jimenez, A.; Mahoney, G.; Mehta, D.; Qassemzadeh, H.; Scott, T. (November 1973). "Algorithms for ASTAP--A network-analysis program". IEEE Transactions on Circuit Theory. 20 (6): 628–634. doi:10.1109/tct.1973.1083755.
  3. Hachtel, G.; Brayton, R; Gustavson, F. (January 1971). "The Sparse Tableau Approach to Network Analysis and Design". IEEE Transactions on Circuit Theory. 18: 101–113. doi:10.1109/TCT.1971.1083223.