This paper presents a novel hierarchical symbolic analysis methodnfor automatically producing relationships between the parameters of annanalog network and the building blocks of the network. The originalitynof the symbolic technique stems from exploiting regularity aspects fornaddressing the exponential complexity of the symbolic expressions. Thenregularity aspects that were identified are: 1) structural regularity:nmajority of the network blocks are connected in identical templates andn2) symbolic parameter regularity: parameters for a connection templatenrequire similar sets of operations. The paper discusses the threencomponents of the proposed symbolic analysis method: 1) an efficientnrepresentation of symbolic expressions, 2) an algorithm for constructionnof symbolic expressions; and 3) a decomposition technique for extractingnthe structural regularity of a network. For large networks, the size ofnthe symbolic models produced by our symbolic analysis method is muchnless than the size of the models produced by other methods such as thentwo-graph method. We mathematically show that the generated models arenof polynomial size if the two kinds of regularity are exploited. Thendescribed symbolic technique was implemented and used successfully fornsynthesis and optimization of different analog systems such as filtersnand communication systems
展开▼
