Abstract:
In this paper we will present an algorithm that is capable of recognizing symmetry in an electronic network graph in better than O((n+b)/sup 2/) time for typical circuits...Show MoreMetadata
Abstract:
In this paper we will present an algorithm that is capable of recognizing symmetry in an electronic network graph in better than O((n+b)/sup 2/) time for typical circuits. Applications in symbolic analysis and behavioural modeling are presented.<>
Date of Conference: 30 May 1994 - 02 June 1994
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7803-1915-X
References is not available for this document.
Select All
1.
L. Astier, R. K. Henderson, M. Hinners, P. Nussbaum, L. Menevaut and A. El Khalifa, "Plan-Frame: A Framework for Design Knowledge Capture", Proc. EDAC/EUROASIC'93, 1993-February.
2.
G. Gielen and W. M. C. Sansen, Symbolic Analysis for Automated Design of Analog Integrated Circuits, Kluwer Academic Publishers, 1991.
3.
M. E. Kole, J. Smit and O. E. Herrmann, "Symbolic Solution of the DC Operating Point", Proc. SMACD'92, 1992-October.
4.
H. A. Mantooth, Higher Level Modelling of Analog Integrated Circuits, August 1990.
5.
M. Meijerink, Symmetric in ccn electrisch netwerk, August 1993.
6.
J. Smit, "The Efficient Calculation of Symbolic Determinants", Proc. SYMSAC'76, 1976-August.
7.
J. Smit, K. Woodgate, H. V.D. Belt and O.E. Herrmann, "CAD tools for the Symbolic Analysis of Analog Designs", Proceedings of the IOP-Workshop, 1990-November.
