Analysis of Complex Linear Periodically Time-Varying Circuits by Method of Reduced Matrix D-Trees

Abstract

The paper proposes the method of reduced matrix D-trees, which is an improved version of the method of matrix d-trees. This method is a further development of the application of one of the subcircuit methods, the so-called d-tree method, to the symbolic analysis of linear circuits with constant parameters The method of reduced matrix D-trees, like the d-tree method, provides a significant reduction in the required computer time for modeling circuits, which has a mathematical meaning, consisting in the bringing out of similar terms in the formed complex symbolic expressions. Since there are, in fact, many symbolic terms in such expressions, this reduction in time is due to such factoring. The method is illustrated using a model of a long line consisting of a cascade connection of a large number of elementary links. The results of the computer simulation are also presented.