Fundamentals of Computer-Aided Circuit Simulation

Front Cover
Springer Science & Business Media, Nov 30, 1987 - Technology & Engineering - 176 pages
0 Reviews
From little more than a circuit-theoretical concept in 1965, computer-aided circuit simulation developed into an essential and routinely used design tool in less than ten years. In 1965 it was costly and time consuming to analyze circuits consisting of a half-dozen transistors. By 1975 circuits composed of hundreds of transistors were analyzed routinely. Today, simulation capabilities easily extend to thousands of transistors. Circuit designers use simulation as routinely as they used to use a slide rule and almost as easily as they now use hand-held calculators. However, just as with the slide rule or hand-held calculator, some designers are found to use circuit simulation more effectively than others. They ask better questions, do fewer analyses, and get better answers. In general, they are more effective in using circuit simulation as a design tool. Why? Certainly, design experience, skill, intuition, and even luck contribute to a designer's effectiveness. At the same time those who design and develop circuit simulation programs would like to believe that their programs are so easy and straightforward to use, so well debugged and so efficient that even their own grandmother could design effectively using their program.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

1 CIRCUIT EQUATION FORMULATION
1
13 Modified Nodal Analysis
10
14 Sparse Tableau Analysis
12
2 LINEAR EQUATION SOLUTION
17
22 LU Transformation
21
23 LU Transformation Variations
23
24 Determinants
29
26 Iterative Methods
33
54 Truncation Error of Integration Formulas
101
55 Stability of Integration Methods
107
56 Automatic Timestep Control
112
6 ADJOINT NETWORKS AND SENSITIVITY
125
62 Element Sensitivity
126
63 SmallSignal Sensitivities
131
64 Noise and Group Delay Response
134
7 POLEZERO EVALUATION
137

3 SPARSE MATRIX METHODS
37
32 Optimal Ordering
45
4 NONLINEAR EQUATION SOLUTION
53
42 Convergence and Termination
58
43 Variations of NewtonRaphson Iteration
66
44 Internal Device Node Suppression
74
5 NUMERICAL INTEGRATION
87
52 Application of Integration Formulas
92
53 Construction of Integration Formulas
96
72 Mullers Method
141
8 STATISTICAL ANALYSIS
149
82 Tracking and Pivots
151
83 Pivot Sorting Algorithm
156
84 Correlation
158
REFERENCES
161
INDEX
173
Copyright

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information