Scribd
Upload
4 views21 pages

Lecture 8 PDF

LECTURE

Uploaded by

Amit Kumar Dash
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
4 views21 pages

Lecture 8 PDF

LECTURE

Uploaded by

Amit Kumar Dash
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/ 21

1

2
Block Diagram Representation of a System

3
4
5
Signal Flow Graph
■ A signal-flow graph consists of a network in which nodes are connected by directed branches.

■ It depicts the flow of signals from one point of a system to another and gives the relationships
among the signals.

■ Signal flow graphs and block diagrams are alternative, though equivalent, tools for graphical
representation of interconnected systems

6
Terminologies
• An input node or source contain only the outgoing branches. i.e., X1

7
Terminologies
• An input node or source contain only the outgoing branches. i.e., X1
• An output node or sink contain only the incoming branches. i.e., X4

8
Terminologies
• An input node or source contain only the outgoing branches. i.e., X1
• An output node or sink contain only the incoming branches. i.e., X4
• A path is a continuous, unidirectional succession of branches along which no
node is passed more than ones. i.e.,
X1 to X2 to X3 to X4 X1 to X2 to X4

9
Terminologies
• An input node or source contain only the outgoing branches. i.e., X1
• An output node or sink contain only the incoming branches. i.e., X4
• A path is a continuous, unidirectional succession of branches along which no
node is passed more than ones. i.e.,

• A forward path is a path from the input node to the output node. i.e.,
X1 to X2 to X3 to X4 , and X1 to X2 to X4 , are forward paths.

10
Terminologies
• An input node or source contain only the outgoing branches. i.e., X1
• An output node or sink contain only the incoming branches. i.e., X4
• A path is a continuous, unidirectional succession of branches along which no
node is passed more than ones. i.e.,

• A forward path is a path from the input node to the output node. i.e.,
X1 to X2 to X3 to X4 , and X1 to X2 to X4 , are forward paths.
• A feedback path or feedback loop is a path which originates and terminates on
the same node. i.e.; X2 to X3 and back to X2 is a feedback path.

11
12
Signal Flow Graph
Mason's Gain Formula
■ Let R(s) is the input of the system
■ C(s) is the output of the system
■ Then the transfer function of the system is T(s) = C(s)/R(s)
1
■ Over all gain T= (σ𝐾 𝑃𝐾 ∆𝐾 )
∆
■ K is the number of forward path
■ Where T= T(s) is Transfer function of the system
■ Pk forward path gain of the Kth forward path
■ Δ = 1- (sum of individual loop gains)+(sum of two non touching loops)- (sum of three non touching
loops)+(sum of four non touching loops)-…..
■ Δk = 1- sum of loop gains which are not touching to the Kth forward path

13
Steps To Solve SGF

14
Steps
■ Step 1: Identify the number of Forward path. i.e K = ???
■ Step 2 : Evaluate the Forward path Gains P1, P2, Pk……
■ Step 3: Identify the Individual Loop Gains P11, P21, P31, P41….
■ Step 4: Identify the Two-Non Touching Loop Gains P12, P22, P32…
■ Step 5: Evaluate ∆
■ Step 6 : Evaluate ∆𝐾

1
Finally, Over all gain T = σ𝐾 𝑃𝐾 ∆𝐾
∆

15
Step 1 &2:

16
Step 3:

17
Step 4

18
Step 5 and Step 6

19
Transfer Function

20
Questions

21

You might also like