Scribd
Upload
89 views3 pages

Chapter 4: Signal Flow Graphs

This document introduces signal flow graphs, which provide an alternate approach to block diagrams for graphically representing control system dynamics. A signal flow graph represents a set of simultaneous linear algebraic equations through a network of nodes connected by directed branches. Each node represents a variable, branches represent signal multipliers, and arrows indicate the direction of signal flow. Mason's gain formula can be used to obtain relationships among variables in a control system represented by a signal flow graph, without having to reduce the graph. The formula relates the overall gain between an input and output node to various path gains and loop gains in the graph.

Uploaded by

Muhammed Ifkaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
89 views3 pages

Chapter 4: Signal Flow Graphs

This document introduces signal flow graphs, which provide an alternate approach to block diagrams for graphically representing control system dynamics. A signal flow graph represents a set of simultaneous linear algebraic equations through a network of nodes connected by directed branches. Each node represents a variable, branches represent signal multipliers, and arrows indicate the direction of signal flow. Mason's gain formula can be used to obtain relationships among variables in a control system represented by a signal flow graph, without having to reduce the graph. The formula relates the overall gain between an input and output node to various path gains and loop gains in the graph.

Uploaded by

Muhammed Ifkaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Chapter 4: Signal flow graphs

4.1. Introduction
The block diagram is useful for graphically representing control system dynamics and is used extensively
in the analysis and design of control systems. An alternate approach for graphically representing control
system dynamics is the signal flow graph approach, due to S. J. Mason. It is noted that the signal flow
graph approach and the block diagram approach yield the same information and one is in no sense
superior to the other.

A signal flow graph is a diagram that represents a set of simultaneous linear algebraic equations. When
applying the signal flow graph method to analyses of control systems, we must first transform linear
differential equations into algebraic equations in s.

A signal flow graph consists of a network in which nodes are connected by directed branches. Each node
represents a system variable, and each branch connected between two nodes acts as a signal multiplier.
Note that the signal flows in only one direction. The direction of signal flow is indicated by an arrow
placed on the branch, and the multiplication factor is indicated along the branch. The signal flow graph
depicts the flow of signals from one point of a system to another and gives the relationships among the
signals.

As mentioned earlier, a signal flows. Graph contains essentially the same information as a block
diagram. If a signal flow graph is used to represent a control system, then a gain formula, called Mason's
gain formula, may be used to obtain the relationships among system variables without carrying out
reduction of the graph.

EE4001: Control Systems I | Chapter 4 1


4.2. Definitions

Term Definition

Node A node is a point representing a variable or signal.

The transmittance is a real gain or complex gain between two nodes. Such gains
Transmittance
can be expressed in terms of the transfer function between two nodes.

A branch is a directed line segment joining two nodes. The gain of a branch is a
Branch
transmittance.
Input node or An input node or source is a node that has only outgoing branches. This
source corresponds to an independent variable.
An output node or sink is a node that has only incoming branches. This
Output node or sink
corresponds to a dependent variable.

Mixed node A mixed node is a node that has both incoming and outgoing branches.

A path is a traversal of connected branches in the direction of the branch arrows.


If no node is crossed more than once, the path is open. If the path ends at the
Path same node from which it began and does not cross any other node more than
once, it is closed. If a path crosses some node more than once but ends at a
different node from which it began, it is neither open nor closed.

Loop A loop is a closed path.

Loop gain The loop gain is the product of the branch transmittances of a loop.

Non-touching loops Loops are non-touching if they do not possess any common nodes.

A forward path is a path from an input node (source) to an output node (sink)
Forward path
that does not cross any nodes more than once.

A forward path gain is the product of the branch transmittances of a forward


Forward path gain
path.

EE4001: Control Systems I | Chapter 4 2


4.3. Mason’s gain formula for signal flow graphs
In many practical cases, we wish to determine the relationship between an input variable and an output
variable of the signal flow graph. The transmittance between an input node and an output node is the
overall gain, or overall transmittance, between these two nodes. Mason's gain formula, which is
applicable to the overall gain, is given by

Where,

Path gain or transmittance of forward path


Determinant of graph

1 - (sum of all individual loop gains) + (sum of gain products of all possible combinations
of two non-touching loops) - (sum of gain products of all possible combinations of three
Δ non-touching loops) + . . .

1− + − +⋯⋯
, , ,

Sum of all individual loop gains

Sum of gain products of all possible combinations of two non-touching loops


,

Sum of gain products of all possible combinations of three non-touching loops


, ,
Cofactor of the forward path determinant of the graph with the loops touching the
Δ forward path removed, that is, the cofactor Δ , is obtained from Δ by removing the
loops that touch path

EE4001: Control Systems I | Chapter 4 3

You might also like