Circuit complexity reduction for symbolic analysis of analog integrated circuits

This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used as a standard reduction engine that ensures the validity of the resulting network model in a specific (set of) design point(s) within a given frequency range and a given magnitude and phase error. It can also be used as an analysis engine to extract symbolic expressions for poles and zeroes. The reduction technique is driven by analysis of the signal flow graph associated with the network model. Experimental results show the effectiveness of the approach.

[1]  Georges Gielen,et al.  ISAAC: a symbolic simulator for analog integrated circuits , 1989, IEEE J. Solid State Circuits.

[2]  Qicheng Yu,et al.  Efficient approximation of symbolic network functions using matroid intersection algorithms , 1995, Proceedings of ISCAS'95 - International Symposium on Circuits and Systems.

[3]  P. Wambacq,et al.  Efficient symbolic computation of approximated small-signal characteristics , 1994, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '94.

[4]  Samuel J. Mason,et al.  Feedback Theory-Some Properties of Signal Flow Graphs , 1953, Proceedings of the IRE.

[5]  M.G.R. Degrauwe,et al.  A symbolic analysis tool for analog circuit design automation , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[6]  G. E. Alderson,et al.  Computer generation of symbolic network functions-A new theory and implementation , 1973 .

[7]  C. Coates,et al.  Flow-Graph Solutions of Linear Algebraic Equations , 1959 .

[8]  Qicheng Yu,et al.  Approximate symbolic analysis of large analog integrated circuits , 1994, ICCAD '94.