On Physical Realizability of Signal Flow Graphs and Realization Techniques

摘要

The problem of physical realizability of the signal flow graphs is taken up in this thesis and two classes of signal flow graphs are defined. It is shown that the class A encompasses all networks with independent sources, excluding mutual inductances. The realizability condition for this class is given and a realization technique established. The second class, that is class B is shown to cover a very large class of active networks. The realizability condition and a realization technique for this class are also given. The importance of these results for the network analysis and synthesis is discussed. Some aspects of the network synthesis problem are also discussed and certain advantages of the synthesis through signal flow graph are pointed out. An attempt is made to establish an algorithm for deriving a member of class A or class B of signal flow graphs from the specified network function. Some difficulties in the way of achieving this are brought out.