A comparative study of symbolic network analysis methods fornanalog integrated circuits of practical size is presented. The methodsnare compared with respect to two important criteria: (1) the runningntime limits of the different algorithms used within every method and (2)nthe number of terms that are generated needlessly; i.e., generatedninvalid terms and cancelling terms. The methods are compared for severalnanalog integrated building blocks. The results indicate that conclusionsnabout the efficiency of the different symbolic analysis methods basednupon comparisons for small circuits, can be misleading. The study alsonallows the reader to make a good choice for a symbolic analysis methodnas the core routine of a modern symbolic analyzer with symbolicnsimplification capabilities
展开▼
