A family of matroid intersection algorithms for the computation of approximated symbolic network functions

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 if 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