Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
40 views

Block Diagram and Signal Flow

A block diagram is a pictorial representation of a system that shows the relationship between its components. It depicts the flow of signals through each component using arrows. Common block diagram topologies include cascades, parallels, and feedback. Complicated block diagrams can be reduced to canonical form using transformations. Signal flow graphs are an alternative graphical method to determine a system's transfer function using Mason's gain rule.

Uploaded by

eltn s.
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
40 views

Block Diagram and Signal Flow

A block diagram is a pictorial representation of a system that shows the relationship between its components. It depicts the flow of signals through each component using arrows. Common block diagram topologies include cascades, parallels, and feedback. Complicated block diagrams can be reduced to canonical form using transformations. Signal flow graphs are an alternative graphical method to determine a system's transfer function using Mason's gain rule.

Uploaded by

eltn s.
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

BLOCK DIAGRAM

BLOCK DIAGRAM OF A SYSTEM


• is a pictorial representation of a function performed by each component and
flow of signal.

• is a shorthand, graphical representation of a physical system, illustrating the


functional relationships among its components.

• is a shorthand pictorial representation of the cause-and-effect relationship of a


system.
  The simplest form of the block diagram is the single block, with one input
and one output.

 The interior of the rectangle representing the block usually contains a


description of or the name of the element, or the symbol for the mathematical
operation to be performed on the input to yield the output.

 The arrows represent the direction of information or signal flow


 The operations of addition and subtraction have a special representation
 The block becomes a small circle, called a summing point, with the appropriate
plus or minus sign associated with the arrows entering the circle.
 Any number of inputs may enter a summing point.
 The output is the algebraic sum of the inputs.
 Some books put a cross in the circle.
 In order to have the same signal or variable be an input to more than one
block or summing point, a takeoff point is used.
 Distributes the input signal, undiminished, to several output points.
 This permits the signal to proceed unaltered along several different paths to
several destinations.
 TOPOLOGIES

 We will now examine some common topologies for interconnecting


subsystems and derive the single transfer function representation for each of
them.
 These common topologies will form the basis for reducing more complicated
systems to a single block.
CASCADE

 Any finite number of blocks in series may be algebraically combined by


multiplication of transfer functions.
 That is, n components or blocks with transfer functions G1 , G2, . . . , Gn,
connected in cascade are equivalent to a single element G with a transfer
function given by.
PARALLEL FORM:

 Parallel subsystems have a common input and an output formed by the


algebraic sum of the outputs from all of the subsystems.
FEEDBACK FORM:

 The third topology is the feedback form. Let us derive the transfer function
that represents the system from its input to its output. The typical feedback
system, shown in figure:

The system is said to have negative feedback if the sign at the summing junction
is negative and positive feedback if the sign is positive.
Canonical Form of a Feedback Control System

The system is said to have


negative feedback if the sign
at the summing junction is
negative and positive
feedback if the sign is
positive.
REDUCTION TECHNIQUES
REDUCTION TECHNIQUES
REDUCTION OD COMPLICATED BLOCK DIAGRAMS:

The block diagram of a practical feedback control system is often quite


complicated. It may include several feedbacks or feedforward loops, and multiple
inputs. By means of systematic block diagram reduction, every multiple loop
linear feedback system may be reduced to canonical form.
The following general steps may be used as a basic approach in the reduction of
complicated block diagrams.

Step 1: Combine all cascaded blocks using Transformation


Step 2: Combine all parallel blocks using Transformation
Step 3: Eliminate all minor feedback loop using Transformation
Step 4: Shift summing points to the left and takeoff points to the right of the major loop, using
Transformation 7, 10, and 12.
Step 5: Repeat Step 1 to 4 until the canonical form has been achieved for a particular input.
Step 6: Repeat Step 1 to 5 for each input, as required.
SUPERPOSITION OF MULTIPLE INPUTS

Step 1: Set all inputs except one equal to zero.


Step 2: Transform the block diagram to canonical form, using the transformations.
Step 3: Calculate the response due to the chosen input acting alone.
Step 4: Repeat Steps 1 to 3 for each of the remaining inputs.
Step 5: Algebraically add all of the responses (outputs) determined in Step 1 to 4. This sum is the
total output of the system with all inputs acting simultaneously.
SIGNAL FLOW
GRAPHS
SUPERPOSITION OF MULTIPLE INPUTS

Signal Flow Graph (SFG) is a graphical representation of block diagrams.


SFG is also used to determine the overall transfer function of a control system.
SFG is an easier method to determine the transfer function as compared to Block Diagram
Reduction as we do not have t reduce the SFG
Example on construction of an SFG, consider the following algebraic equations:
Elements of a Signal Flow Graph:

Nodes: While constructing an SFG, the junction points that are used to
represent variables are called as Nodes.
Branches: The nodes are connected together by lines called Branches.
The signal travels from one node to another node along these branches.
Input Node (Source): The node which has only outgoing branches.
Mason’s Gain Rule
In order to calculate the overall transfer function of a system, an American
electronics engineer S.J. Mason introduced a rule which is called as the
Mason’s Gain Rule.
The Mason’s Gain Formula is given by:

𝐶(𝑆) 𝑛 𝑃 𝑘 ∙ ∆𝑘
=∑
𝑅 (𝑆) 𝑘=1 ∆
Mason’s Gain Rule
 = Determinant of S.F.G.
=

 = Associated Path Factor


= The part of S.F.G that is non-touching with the k th forward path
=
Mason’s rule - Definitions

Loop gain: The product of branch gains found by traversing a path that starts at a node and ends at the same
node, following the direction of the signal flow, without passing through any other node more than once.
G2(s)H1(s), G4(s)H2(s), G4(s)G5(s)H3(s), G4(s)G6(s)H3(s)

Forward-path gain: The product of gains found by traversing a path from input node to output node in the
direction of signal flow. G1(s)G2(s)G3(s)G4(s)G5(s)G7(s), G1(s)G2(s)G3(s)G4(s)G5(s)G7(s)

Nontouching loops: loops that do not have any nodes in common. G2(s)H1(s) does not touch
G4(s)H2(s), G4(s)G5(s)H3(s), and G4(s)G6(s)H3(s)

Nontouching-loop gain: The product of loop gains from nontouching loops taken 2, 3,4, or more at a time.
[G2(s)H1(s)][G4(s)H2(s)], [G2(s)H1(s)][G4(s)G5(s)H3(s)], [G2(s)H1(s)][G4(s)G6(s)H3(s)]
Mason’s rule - Definitions

Loop gain: The product of branch gains found by traversing a path that starts at a node and ends at the same
node, following the direction of the signal flow, without passing through any other node more than once.
G2(s)H1(s), G4(s)H2(s), G4(s)G5(s)H3(s), G4(s)G6(s)H3(s)

Forward-path gain: The product of gains found by traversing a path from input node to output node in the
direction of signal flow. G1(s)G2(s)G3(s)G4(s)G5(s)G7(s), G1(s)G2(s)G3(s)G4(s)G5(s)G7(s)

Nontouching loops: loops that do not have any nodes in common. G2(s)H1(s) does not touch
G4(s)H2(s), G4(s)G5(s)H3(s), and G4(s)G6(s)H3(s)

Nontouching-loop gain: The product of loop gains from nontouching loops taken 2, 3,4, or more at a time.
[G2(s)H1(s)][G4(s)H2(s)], [G2(s)H1(s)][G4(s)G5(s)H3(s)], [G2(s)H1(s)][G4(s)G6(s)H3(s)]

You might also like