Scribd
Upload
12 views

Control System AB Lec-67 - 08.02.02024

This document discusses signal flow graphs (SFG) as a method for analyzing higher order dynamic systems. It defines key SFG concepts like nodes, branches, forward and feedback paths, and loops. Mason's gain formula is presented for determining a system's transfer function from its SFG. Examples are provided and solved in class to illustrate applying these SFG analysis techniques.

Uploaded by

kingnickking04
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Control System AB Lec-67 - 08.02.02024

This document discusses signal flow graphs (SFG) as a method for analyzing higher order dynamic systems. It defines key SFG concepts like nodes, branches, forward and feedback paths, and loops. Mason's gain formula is presented for determining a system's transfer function from its SFG. Examples are provided and solved in class to illustrate applying these SFG analysis techniques.

Uploaded by

kingnickking04
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Course Name: Control Systems

Course Code: ECE/EEE/INSTR F242


Dr. Ankur Bhattacharjee
Department of Electrical and Electronics Engineering,
BITS Pilani
Hyderabad Campus BITS-Pilani, Hyderabad Campus, India
Schematic modelling of Dynamic Systems:
Signal Flow Graph (SFG)

Title| Presenter 2 BITS Pilani, Hyderabad Campus


Signal FlowGraph (SFG)
 For complicated/higher order systems, block diagram reduction
can be difficult
 SFG is a Formula-based approach to find the transfer function of a
higher order system consisting of many gain blocks

 Formula used for SFGs is called “Mason's Gain Formula”

 A simple Signal Flow Graph is represented as

 The nodal relationship of the Signal Flow Graph is represented as


Signal FlowGraph (SFG)

 Every variable in a SFG is designated as a Node

 Every transmission function in the SFG is designated as a Branch

 An arrow denotes the direction of the branch

 An Input Node or source contains an outgoing branch

 A Path is a continuous, unidirectional succession of branches along


which no node is passed more than ones.
Conversion of Block Diagram to SFG
Forward and Feedback Path
 A Forward Path is a path from the input node to the output node.

 For the given problem, forward path is


 However, the path between and can have or gain

 Hence, both are Forward Paths

 A Feedback Path or loop is a path that originates and ends in the


same node
 For the given problem, and are both
feedback paths
Block Diagram and CorrespondingSFG

7
Block Diagram and CorrespondingSFG
PracticeProblem
Identify the:
a) Forward Paths (Gain), b) Feedback Paths (Gains)
c) Non-Touching Loops
Mason’s Gain Formula

 The transfer function of a system represented by a


signal flow graph is given by;

where,

Number of Forward Paths


Gain of Forward Path
Determinant of the Forward Path
Determinant of the system
Title| Presenter 10 BITS Pilani, Hyderabad Campus
Mason’s Gain Formula - Determinants

System Determinant
= 1 – (Sum of all individual Loop Gains) + (Sum of the products of the gains of all
possible two loops that do not touch each other) - (sum of the products of the
gains of all possible three loops that do not touch each other) +… and so forth with
sums of higher number of non-touching loop gains

It is that ‘ ’ for the part of the SFG that does not touch the forward path
( if there are no non-touching loops in any path other than forward path)

Title| Presenter 11 BITS Pilani, Hyderabad Campus


Practice Problem
 Find the transfer function of the Signal Flow Graph given below:

Solved in class

Title| Presenter 12 BITS Pilani, Hyderabad Campus


Practice Problem
 Find the Transfer Function for the SFG given below.

Solved in class

Title| Presenter 13 BITS Pilani, Hyderabad Campus


BITSPilani
BITS Pilani
Hyderabad Campus
Hyderabad Campus

Thank you

You might also like