Por motivos de mantenimiento se ha deshabilitado el inicio de sesión temporalmente. Rogamos disculpen las molestias.
Presentation
A Family of matroid intersection algorithms for the computation of approximated symbolic network functions
Author/s | Wambacq, Piet
Fernández Fernández, Francisco Vidal Gièlen, Georges G.E. Sansen, Willy M.C. Rodríguez Vázquez, Ángel Benito |
Department | Universidad de Sevilla. Departamento de Electrónica y Electromagnetismo |
Publication Date | 1996 |
Deposit Date | 2020-03-06 |
Published in |
|
ISBN/ISSN | 0-7803-3073-0 0271-4310 |
Abstract | In recent years, the technique of simplification during generation has turned out to be very promising for the efficient computation of approximate symbolic network functions for large transistor circuits. In this paper ... In recent years, the technique of simplification during generation has turned out to be very promising for the efficient computation of approximate symbolic network functions for large transistor circuits. In this paper it is shown how symbolic network functions can be simplified during their generation with any well-known symbolic network analysis method. The underlying algorithm for the different techniques is always a matroid intersection algorithm. It is shown that the most efficient technique is the two-graph method. An implementation of the simplification during generation technique with the two-graph method illustrates its benefits for the symbolic analysis of large analog circuits. |
Citation | Wambacq, P., Fernández Fernández, F.V., Gièlen, G.G.E., Sansen, W.M.C. y Rodríguez Vázquez, Á.B. (1996). A Family of matroid intersection algorithms for the computation of approximated symbolic network functions. En IEEE International Symposium on Circuits and Systems (806-809), Institute of Electrical and Electronics Engineers. |
Files | Size | Format | View | Description |
---|---|---|---|---|
A FAMILY OF MATROID INTERSECTION ... | 510.5Kb | [PDF] | View/ | |