Graph-Based Symbolic Technique and Its Application in the Frequency Response Bound Analysis of Analog Integrated Circuits

Algorithm 3

Graph to polynomial form.

(1) Expand the nodes in the graph containing the symbol 𝑤.

(2) Read the graph in a DFS fashion and preserve only those routes from

 root to bottom with at least one occurrence of symbol 𝑤.

(3) The number of occurrences of the symbol is the power of 𝑤 for a given route.

(4) Express each route as a sum of products.

(5) The coefficients are the summation of all appended routes for each power of 𝑤.