Signal Flow Graphs
A signal-flow graph or signal-flow graph (SFG), created by Claude Shannon,but usually known as a Mason graph when Samuel Thomas Jefferson Mason who coined the term, it is a specialised flow graph, a directed graph within which nodes represent system variables, and branches (edges, arcs, or arrows) represent functional connections between pairs of nodes. Thus, signal-flow graph theory builds on it of directed graphs (also known as digraphs), which has also that of orientated graphs. This mathematical theory of digraphs exists, of course, quite aside from its applications.source
Defination of SFG
SFG stands for Signal Flow Graph. It is a diagram that represents a simultaneous equations. It consist of a network in which nodes are connected by directed branches
Parameters of SFG
- Node: A node is a point representing a variable
- Branch: A branch is a line joining two nodes.
- Path: A path is a continuous set of branches which traversed in the direction indicated by the branch arrows
- Loop:It is a closed path
- Loop gain: It is the product of gains of all branches in the loop
- Non-touching loops:It has not any common nodes
- Forward path: It is a path from input node to the output node which does not cross any node more than once
- Forward path gain: It is the product of branch transmittances of a forward path
Why it is used:
Signal flow graph is used to find-
1.Stability of the system
2.Controllability of a system
3.Transfer Function of the system.
4.Poles of the system
To understand this more clearly, see this
This is my entry for city-scape photography