Signal Flow Graph Algebra

1. Addition Rule- the value of the variable designated by a node is

equal to the sum of all signals entering the node
2. Distribution Rule- the value of the variable designated by a node
is transmitted on every branch leaving that node
3. Multiplication Rule- a cascaded connection of n−1 branches with
transmission functions A21, A32, A 42… An (n−1) can be replaced by a
single branch with new transmission function equal to the product
of the old ones.

Additional definitions:
 Path- a continuous unidirectional succession of branches along
which no node is passed more than once; signal travels along this
 Branch- basic element of a signal flow graph; a unidirectional line
segment
 Nodes- input and output points; represents system variable which
is equal to the sum of all incoming signals at the node
 Transmittance- this allows the branch transmit the input node
signal to the output node
 Input node or source- node with only out going branches
 Output node or sink- node with only incoming branches
 Path- a continuous, unidirectional succession of branches along
which no node is passed more than once
 Feedback path/ feedback loop- a path which originates and
terminates on the same node
 Self loop- feedback loop consisting of a single branch
Signal flow graph representation of a system described by a set of
simultaneous equations:
1. Write the equations in the form:
x 1= A11 x 1+ A 12 x 2+ …+ A1 n xn
x 2= A21 x 1 + A22 x 2 +…+ A 2 n x n
∙
∙
∙
x m= A m 1 x 1+ A m 2 x 2 +…+ A mn x n

2. Arrange the m or n (whichever is larger) nodes from left to right

3. Connect the nodes by the appropriate branches A11, A12, etc
4. If the desired output node has outgoing branches, add a dummy
node and a unity-gain branch
5. Rearrange the nodes and/or loops in the graph to achieve
maximum pictorial clarity
Example:
Construct a signal flow graph for the simple resistance network:

R1 R2

+
R3 R4
V3
V1
-