摘要
目前广泛应用于信号与系统分析的Mason公式,必须对相应网络进行大量而繁琐的拓扑结构分析,这不仅影响网络分析的规模、效率和精度,而且要研究专门的算法来实现拓扑分析。本文提出的流图矩阵分析法,只需对一步构成的矩阵进行严格而简明的变换,不需任何拓扑结构分析等其它运算,就可以得到分析结果。采用稀疏矩阵技术和符号网络函数方法,则可更明显地提高分析效率。
In this paper, it gives the definition of gain matrix Hof branches between which is based on the singnal flow graph, then by using one-one relations between the process of equivalent simplifing of signal flow graph and transformation of matrix H, it gives two theorems and its teat-ifing, so puts forward the analysis method of flow graph. Using this method, to get results, it's only by transformation matrix H with rigorously, concisely and regularly, needs no other calculation and analysis of signal flow graph and sub-graph.
出处
《通信学报》
EI
CSCD
北大核心
1993年第6期73-79,共7页
Journal on Communications
