A unified approach to the approximate symbolic analysis of large analog integrated circuits

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 43, Issue 8, 1996, Pages 656-669

  Qicheng, Yu ^a   Sechen, Carl ^a  

^a Crystal Semiconductor Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; FREQUENCY DOMAIN ANALYSIS; FUNCTIONS; GRAPH THEORY; LINEAR NETWORK ANALYSIS; NUMERICAL ANALYSIS; SEMICONDUCTOR DEVICE MODELS; TREES (MATHEMATICS);

APPROXIMATE SYMBOLIC ANALYSIS; COLOR CONSTRAINED SPANNING TREES; INSIGNIFICANT CIRCUIT ELEMENTS; SECOND APPROXIMATION STRATEGY; TWO GRAPH TREE ENUMERATION METHOD;

INTEGRATED CIRCUITS;

EID: 0030216744     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.526681     Document Type: Article

References (33)

1. M. Amadori. R. Gucrricri, and E. Malavasi, ''Symbolic analysis of simplified tiansfer functions," Analog Inleg. Circuits Sigruil Processing, vol. 3, no. 1, pp. 9-29, 1993.
2. S.-M. Chang, J. F. MacKay, and G. M. Wierzba, "Matrix reduction and numerical approximation during computation techniques for symbolic analog circuit analysis," in Proc. IEEE ISCAS, 1992, pp. 1153-1156.
3. C. S. Chiang, "A perturbation approach to the symbolic analysis of analog circuits,'' Ph.D. dissertation, Yale University, New Haven, CT, 1992.
4. L. O. Chua and P. M. Lin, Computer-Aided Analysis of Electronic Circuits: Algorithms and Techniques. Englewood Cliffs, NJ: Prentice-Hall, 1975.
5. T. H. Connen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press. 1990.
6. F. V. Fernandez, A. Rodriguez-Vazquez, and J. L. Hucrtas, "Interactive AC modeling and characterization of analog circuits via symbolic analysis," Analog Integ. Circuits Signal Processing, vol. 1, no. 3, pp. 183-208, 1991.
7. F. V. Fernandez, A. Rodriguez-Vazquez, J. D. Martin, and J. L. Huertas, "Formula approximation for flat and hierarchical symbolic analysis," Analog Jnleg. Circuits Signal Processing, vol. 3, no. 1, pp. 43-58, 1993.
8. H. N. Gabow, "Two algorithms for generating weighted spanning trees in order," SIAM J. Computing, vol. 6, pp. 139-150, Mar. 1977.
9. H. N. Gabow and R. E. Tarjan, "Efficient algorithms for a family of matroid intersection problems," J. Algorithms, vol. 5, pp. 80-131, 1984.
10. G. Gielen, H. Walschans, and W. Sansen, "ISAAC: A symbolic simulator for analog integrated circuits," IEEE J. Solid-State Circuits, vol. 24, pp. 1587-1597, Dec. 1989.
11. G. Gielen and W. Sansen, Symbolic Analysis for Automated Design of Analog Integrated Circuits. Boston, MA: Kluwer Academic, 1991.
12. G. Gie.len, P. Wambacq, and W Sansen, "Symbolic analysis methods and applications for analog circuits: A tutorial overview," Proc. IEEE, vol. 82, pp. 287-304, Feb. 1994.
13. M. M. Hassoun and P. M. Lin, "A new network approach to symbolic simulation of large-scale networks," iu Proc. IEEE ISCAS, 1989, pp. 806-809.
14. M. M. Hassoun and K. S. McCarville, "Symbolic analysis of large-scale networks using a hierachical signal flowgraph approach," Analog Integ. Circuits Signal Processing, vol. 3, no. 1, pp. 31-42, 1993.
15. J.-J. Hsu and C. Sechen, "Fully symbolic analysis of large analog integrated circuits," in Proc. IEEE Custom Integ. Circuits Conf., 1994, pp. 457-460.
16. _, "DC small signal symbolic analysis of large analog integrated circuits," IEEE Trans. Circuits Syst. I, vol. 41, pp. 817-828, Dec. 1994.
17. _, "Accurate extraction of simplified symbolic pole/zero expressions for large analog IC's," in Proc. IEEE ISCAS, 1995, pp. 2083-2087.
18. N. Katoh, T. Ibaraki, and H. Mine, "An algorithm for finding A" minimum spanning trees," SIAM J. Computing, vol. 10, pp. 247-255. May 1981.
19. A. Konczykowska and M. Bon, "Automated design software for switched-capacitor IC's with symbolic simulator SCYMBAL," in Proc. IEEE/ACM D AC, 1988, pp. 363-368.
20. A. Liberatore and S. Manetti, "SAPEC-A personal computer program for the symbolic analysis of electric circuits." in Proc. IEEE ISCAS. 1988, pp. 897-900.
21. P. M. Lin, Symbolic Network Analysis, Studies in Electrical and Electronic Engineering 4L New York: Elsevier, 1991.
22. W. Maycda, Graph Theory. New York: Wiley-Interscience, 1972.
23. S. J. Seda, M. G. R. Degrauwe, and W. Fichtner, "A symbolic analysis tool for analog circuit design automation," in IEEE/ACM ICCAD, Dig. Tech. Papers,1988, pp. 488 491.
24. S. J. Seda, M. G. R. Degrauwe, and W. Fichtner. "Lazy-expansion symbolic expression approximation in SYNAP." in IEEE/ACM ICCAD, Dig. Tech. Papers, 1992, pp. 310-317.
25. K. Singhal and J. Vlach, "Symbolic analysis of analog and digital circuits," IEEE Trans. Circuits Syst., vol. CAS-24, pp. 598-609, Nov. 1977.
26. J. A. Starzyk and A. Konczykowska, "Flowgraph analysis of large electronic networks," IEEE Trans. Circuits Syst., vol. CAS-33, pp. 302-315, Mar. 1986.
27. P. Wambacq, G. Gielen, and W. Sansen, "A cancellation-free algorithm for the symbolic simulation of large analog circuits," in Proc. IEEE ISCAS, 1992, pp. 1157-1160.
28. P. Wambacq, F. V. Fernandez, G. Gielen, and W. Sansen, "Efficient symbolic computation of approximated small-signal characteristics," in Proc. Custom Integ. Circuits Conf., May 1994, pp. 461-464.
29. P. Wambacq, F. V. Fernandez, G. Gielen, W. Sansen, and A. Rodriguez-Vazquez, "Algorithm for efficient symbolic analysis of large analogue circuits," Electron. Lett., vol. 30, pp. 1108-1109, July 1994.
30. W.-C. S. Wu et al, "Digital-compatible high-performance operational amplifier with rail-to-rail input and output ranges," IEEE J. Solid-State Circuits, vol. 29, pp. 63-66, Jan. 1994.
31. Q. Yu and C. Sechen, "Generation of color-constrained spanning trees with application in symbolic circuit analysis," in Proc. 4th Great Lakes Symp. VLSI, Mar. 1994, pp. 252-255. Also to be published in Int. J. Circuit Theory Applicat.
32. _, "Approximate symbolic analysis of large analog integrated circuits," in IEEE/ACM ICCAD, Dig. Tech. Papers, 1994, pp. 664-671.
33. _, "Efficient approximation of symbolic network functions using matroid intersection algorithms," in Proc. IEEE ISCAS, 1995, pp. 2088-2091.