Symbolic analysis of large analog circuits using a sensitivity-driven enumeration of common spanning trees
Symbolic analysis of large analog circuits using a sensitivity-driven enumeration of common spanning trees
复制标题
DOI：
10.1109/82.728847
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
P. Wambacq;P. Dobrovolný;G. Gielen;W. Sansen
中科院分区：
文献类型：
--
作者：
P. Wambacq;P. Dobrovolný;G. Gielen;W. Sansen
提出了一种生成近似符号网络函数的新方法。这种方法被用来分析大型模拟集成电路。它基于拟阵交集算法，该算法直接枚举给定电路的两图表示的公共生成树。该近似算法基于对网络函数的大小相对于网络函数的不同系数的灵敏度的检查。这些灵敏度作为频率的函数控制计数过程。以这种方式，该算法为网络函数的每个系数列举最小数量的主导项。整个算法运行在O(kMN/sup 3/)时间内，其中K是为逼近网络函数的每个系数而必须生成的拟阵交集的平均数目，n是线性化网络中的节点数，m是电路元件的数目。最后给出了实验结果。这些结果表明，这种新的方法优于其他从给定的两图生成近似符号网络函数的方法。
A new approach for the generation of approximate symbolic network functions is presented. This approach is used to analyze large analog integrated circuits. It is based on a matroid intersection algorithm that directly enumerates common spanning trees of a two-graph representation of a given circuit. The approximation algorithm is based on an inspection of the sensitivity of the magnitude of a network function with respect to the different coefficients of a network function. These sensitivities as a function of frequency control the enumeration process. In this way, the algorithm enumerates a minimum number of the dominant terms for each coefficient of the network function The complete algorithm runs in O(Kmn/sup 3/) time, in which K is the average number of matroid intersections that must be generated for the approximation of each coefficient of the network function, n is the number of nodes in the linearized network and m the number of circuit elements. At the end of the paper experimental results are presented. These results indicate that this new approach is superior to other approaches to generate an approximate symbolic network function from a given two-graph.