Signal-flow graph

Known as: Signal flow graph, Mason graph, SFG 
A signal-flow graph or signal-flowgraph (SFG), invented by Claude Shannon, but often called a Mason graph after Samuel Jefferson Mason who coined the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Star-delta transformations are popular in electrical engineering. Of late they have also been tried in reliability analysis… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This article deals with active frequency filter design using signalflow graphs. The procedure of multifunctional circuit design… (More)
  • table 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The Z-source inverter is a recently proposed converter topology that uses a unique X-shaped impedance network on its dc side for… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2003
2003
This paper establishes a general framework for the study of various search procedures in which a group of observers is searching… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
In this paper signal flow graph nonlinear modeling of cascade boost converters is presented. TJnified signal flow graph model of… (More)
  • figure 1
  • figure 8
  • figure 9
  • figure 11
  • table 1
Is this relevant?
2000
2000
A large class of nonlinear dynamic adaptive systems such as dynamic recurrent neural networks can be effectively represented by… (More)
Is this relevant?
1997
1997
In this paper, making use of the Signal-Flow-Graph (SFG) representation and its known properties, we derive a new general method… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Induction motors are modeled by nonlinear higherorder dynamic systems of considerable complexity. The dynamic analysis based on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1979
Highly Cited
1979
A fast algorithm for finding dominators in a flowgraph is presented. The algorithm uses depth-first search and an efficient… (More)
  • figure 1
  • figure 3
  • figure 4
  • table I
  • figure 5
Is this relevant?
1972
1972
A signal flow graph is given and a corresponding Fortran program for the Haar-Fourier transform is described. The algorithm… (More)
  • figure 2
Is this relevant?