Efficient DDD-based symbolic analysis of linear analog circuits

IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing

Volumn 49, Issue 7, 2002, Pages 474-487

  Verhaegen, Wim ^a   Gielen, Georges ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Analog circuits; Determinant decision diagrams (DDDs); Linear symbolic analysis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CALCULATIONS; CAPACITANCE; DATA STRUCTURES; DECISION THEORY; LINEAR EQUATIONS; MATRIX ALGEBRA; TREES (MATHEMATICS);

DETERMINANT DECISION DIAGRAM; EXPRESSION GENERATION ALGORITHM; LINEAR ANALOG CIRCUIT; LINEAR TIME-INVARIANT CIRCUIT; SYMBOLIC ANALYSIS;

LINEAR NETWORK ANALYSIS;

EID: 0036663173     PISSN: 10577130     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSII.2002.804055     Document Type: Article

References (45)

1. P. M. Lin, "A survey of applications of symbolic network functions," IEEE Trans. Circuit Theory, vol. 20, pp. 732-737, Nov. 1973.
2. P. Wambacq, G. Gielen, P. Kinget, and W. Sansen, "High-frequency distortion analysis of analog integrated circuits," IEEE Trans. Circuits Syst. II, vol. 46, pp. 335-345, Mar. 1999.
3. W. Verhaegen and G. Gielen, "Symbolic distortion analysis of analog integrated circuits," in Proc. Eur. Conf. Circuit Theory and Design, Helsinki, Finland, Aug. 2001, pp. I.21-I.24.
4. M. M. Hassoun and K. S. McCarville, "Symbolic analysis of large-scale networks using a hierarchical signal flowgraph approach," J. Analog Integr. Circuits Signal Processing, vol. 3, pp. 31-42, 1993.
5. M. M. Hassoun and P. M. Lin, "A hierarchical network approach to symbolic analysis of large-scale networks," IEEE Trans. Circuits Syst. I, vol. 42, pp. 201-211, Apr. 1995.
6. M. Pierzchała, and B. Rodanski, "Symbolic analysis of large-scale networks by circuit reduction to a two-port," in Proc. Symbolic Methods and Applications in Circuit Design Workshop, Oct. 1996.
7. W. Daems, G. Gielen, and W. Sansen, "Circuit simplification for the symbolic analysis of analog integrated circuits," IEEE Trans. Computer-Aided Design, pp. 395-407, Apr. 2002.
8. J. Vlach and K. Singhal, Computer Methods for Circuit Analysis and Design. New York: Van Nostrand Reinhold, 1983.
9. P. M. Lin, Symbolic Network Analysis. Amsterdam, The Netherlands: Elsevier, 1991.
10. F. V. Fernández Fernandéz, O. Guerra, J. D. Rodríguez-García, and A. Rodríguez-Vázquez, "Symbolic analysis of large analog integrated circuits: The numerical reference generation problem," IEEE Trans. Circuits Syst. II, vol. 45, pp. 1351-1361, Oct. 1998.
11. F. V. Fernández Fernandéz, O. Guerra, J. D. Rodríguez-García, and A. Rodríguez-Vázquez, "Corrections to Symbolic analysis of large analog integrated circuits: The numerical reference generation problem," IEEE Trans. Circuits Syst. II, vol. 46, pp. 485-486, Apr. 1999.
12. S. J. Seda, M. Degrauwe, and W. Fichtner, "Lazy-expansion symbolic expression approximation in SYNAP," in Proc. IEEE/ACM Int. Conf. Computer Aided Design, San Jose, CA, 1988, pp. 310-317.
13. G. Gielen, H. Walscharts, and W. Sansen, "ISAAC: A symbolic simulator for analog integrated circuits," IEEE J. Solid-State Circuits, vol. 24, pp. 1587-1597, Dec. 1989.
14. F. V. Fernández Fernandéz, A. Rodríquez-Vázquez, and J. L. Huertas, "ASAP: A portable program for the symbolic analysis of analog integrated circuits," in Proc. EURO-ASIC, Paris, France, June 1990, pp. 80-85.
15. G. Dröge, R. Sommer, and E. H. Horneber, "Obtaining compact network equations by reduction of matrices," in Proc. Symbolic Methods and Applications in Circuits Design Workshop, Florenz, Italy, 1992, pp. 83-93.
16. R. Sommer, E. Hennig, G. Dröge, and E.-H. Horneber, "Equation-based symbolic approximation by matrix reduction with quantitative error prediction," Alta Frequenza-Rivista Di Elettronica, vol. 5, pp. 317-325, Dec. 1993.
17. J. Hsu and C. Sechen, "DC small signal symbolic analysis of large analog integrated circuits," IEEE Trans. Circuits Syst. I, vol. 41, pp. 817-828, Dec. 1994.
18. E. Hennig, "Symbolic approximation and modeling techniques for analysis and design of analog circuits," Ph.D. dissertation, Univ. Kaiserslautern, Kaiserslautern, Germany, 2000.
19. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. Baltimore, MD: The Johns Hopkins University Press, 1996.
20. Q. Yu and C. Sechen, "A unified approach to the approximate symbolic analysis of large analog integrated circuits," IEEE Trans. Circuits Syst. I, vol. 43, pp. 656-669, Aug. 1996.
21. O. Guerra, J. D. Rodríguez-García, E. Roca, F. V. Fernández Fernandéz, and A. Rodríguez-Vázquez, "A simplification before and during generation methodology for symbolic large-circuit analysis," in Proc. Int. Conf. Electronic Circuits and Systems, vol. 3, Lisbon, Portugal, Sept. 1998, pp. 81-84.
22. J. D. Rodríguez-García, O. Guerra, E. Roca, F. V. Fernández Fernandéz, and A. Rodríguez-Vázquez, "A new simplification before and during generation algorithm," in Proc. Symbolic Methods and Applications in Circuit Design Workshop, 1998, pp. 110-124.
23. J. D. Rodríguez-García, O. Guerra, E. Roca, F. V. Fernández Fernandéz, and A. Rodríguez-Vázquez, "Error control in simplification before generation algorithms for symbolic analysis of large analogue circuits," Electron. Lett., vol. 35, pp. 260-261, Feb. 1999.
24. W. Daems, G. Gielen, and W. Sansen, "Circuit complexity reduction for symbolic analysis of analog integrated circuits," in Proc. Design Automation Conf., New Orleans, LA, June 1999, pp. 958-963.
25. W. Daems, W. Verhaegen, P. Wambacq, G. Gielen, and W. Sansen, "Evaluation of error-control strategies for the linear symbolic analysis of analog integrated circuits," IEEE Trans. Circuits Syst. I, vol. 46, pp. 594-606, May 1999.
26. P. Wambacq, G. Gielen, and W. Sansen, "A new reliable approximation method for expanded symbolic network functions," in Proc. IEEE Int. Symp. Circuits and Systems, vol. 4, 1996, pp. 584-587.
27. W.-K. Chen, "Topological analysis for active networks," IEEE Trans. Circuits Syst. II, vol. 12, pp. 85-91, Mar. 1965.
28. J. A. Starzyk and E. Sliwa, "Upward topological analysis of large circuits using directed graph representation," IEEE Trans. Circuits Syst. II, vol. 31, pp. 410-414, Apr. 1984.
29. M. M. Hassoun, "Hierarchical symbolic analysis of large-scale systems using a Mason's signal flowgraph model," in Proc. IEEE Int. Symp. Circuits and Systems, Singapore, 1991, pp. 802-805.
30. F. V. Fernández Fernandéz and A. Rodríguez-Vázquez, "Interactive AC modeling and characterization of analog circuits via symbolic analysis," J. Analog Integr. Circuits Signal Processing, vol. 1, pp. 183-208, Nov. 1991.
31. P. Wambacq, P. Dobrovolny, G. Gielen, and W. Sansen, "Symbolic analysis of large analog circuits using a sensitivity-driven enumeration of common spanning trees," IEEE Trans. Circuits Syst. II, vol. 45, pp. 1342-1350, Oct. 1998.
32. P. Wambacq, "Symbolic network analysis methods for practical analog integrated circuits: A survey," IEEE Trans. Circuits Syst. II, vol. 45, pp. 1331-1341, Oct. 1998.
33. F. V. Fernández Fernandéz, A. Rodríguez-Váquez, J. L. Huertas, and G. Gielen, Symbolic Analysis Techniques-Applications to Analog Design Automation. New York: IEEE Press, 1998.
34. W. Mayeda, Graph Theory. New York: Wiley-Interscience, 1972.
35. H. N. Gabow, "Two algorithms for generating weighted spanning trees in order," SIAM J. Comput., vol. 6, pp. 139-150, Mar. 1977.
36. N. Katoh, T. Ibaraki, and H. Mine, "An algorithm for finding K minimum spanning trees," SIAM J. Comput., vol. 10, pp. 247-255, May 1981.
37. O. Guerra, J. D. Rodríguez-García, E. Roca, F. V. Fernández Fernandéz, and A. Rodríguez-Vázquez, "An error-controlled methodology for approximate hierarchical symbolic analysis," in Proc. IEEE Int. Symp. Circuits and Systems, vol. III, May 2000, pp. 133-136.
38. C.-J. R. Shi and X.-D. Tan, "Symbolic analysis of large analog circuits with determinant decision diagram," in Proc. IEEE/ACM Int. Conf. Computer Aided Design, San Jose, CA, Nov. 1997.
39. W. Verhaegen and G. Gielen, "Efficient DDD-based symbolic analysis of large linear analog circuits," in Proc. Design Automation Conf., Las Vegas, NV, June 2001, pp. 139-144.
40. C.-J. R. Shi and X.-D. Tan, "Canonical symbolic analysis of large analog circuits with determinant decision diagrams," IEEE Trans. Computer-Aided Design, vol. 19, pp. 1-18, Jan. 2000.
41. X.-D. Tan and C.-J. R. Shi, "Interpretable symbolic small-signal characterization of large analog circuits using determinant decision diagrams," in Proc. Design and Test Eur. Conf., Munich, Germany, 1999.
42. R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Comput., pp. 677-691, 1986.
43. X.-D. Tan and C.-J. R. Shi, "Hierarchical symbolic analysis of analog integrated circuits via determinant decision diagrams," IEEE Trans. Computer-Aided Design, vol. 19, pp. 401-412, Apr. 2000.
44. C.-J. R. Shi, and X.-D. Tan, "Compact representation and efficient generation of s-expanded symbolic network functions for computer-aided analog circuit design," IEEE Trans. Computer-Aided Design, vol. 20, pp. 813-827, July 2001.
45. P. Dobrovolny, "Design tool for symbolic analysis based on the matroid intersection theory," in Proc. IEEE Int. Symp. Circuits and Systems, Monterey, CA, 1998.