Signal Flow Graph

Engr. Marlon Peter G. Balingit

Signal Flow Graph is a Representation of
Block
• is a Representation of Block diagrams
• It is also used to determine the overall transfer function of a control
system
• It is an easier method to determine the transfer function as compared
to block diagram reduction as we do not have to reduce the SFG
• Example of constructional graph considers an algebraic equation.
Consider this equations:
Elements of Signal flow graph
• Nodes - while creating an SFG, junction points are used to represent
variable also called as NODES.
• Branches – the nodes are connected together by lines are called
branches, the signal that travels from one node to another node along
these branches.
• Input node(source) – the signal which only has outgoing branches.
• Output node(sink) – node that has only incoming branches
• Path - It is a traversal of connected branches in the direction of branch
arrows such that no node is traversed more than once.
Elements of Signal flow graph
• Forward path – it is a path from input node to the output node.
• Forward path gain – it is the product of branches gain in traversing a
forward path
• Loop – it is a path which originates and terminates at the same node.
• Loop gain – it is a product of branch gains encountered in traversing a
loop.
• Self loop – loop with only one branch.
• Non-touching loops – loops are said to be non- touching if they do not
posses any common node.
Equivalent representation of block diagram
into signal flow diagram
Equivalent representation of block diagram into
signal flow diagram