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

Welcome to Scribd!

  • 45 views

    On Signal Flow Graph Signal Flow Graph

    Uploaded by

    rub786
    The document discusses signal flow graphs (SFG), which represent systems of simultaneous equations through nodes and branches. An SFG consists of input, output, and mixed nodes connected by directed branches with transmittances. Mason's Gain Formula is used to reduce an SFG to a single transfer function. The key steps are: 1) identify forward paths and their gains, 2) find individual loop gains, and 3) apply Mason's Gain Formula which factors in forward path and loop gains. Examples are provided of constructing SFGs from block diagrams and simultaneous equations. SFGs can solve systems more efficiently than block diagram reduction methods.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    On Signal Flow Graph Signal Flow Graph

    Uploaded by

    rub786
    45 views20 pages
    The document discusses signal flow graphs (SFG), which represent systems of simultaneous equations through nodes and branches. An SFG consists of input, output, and mixed nodes connected by directed branches with transmittances. Mason's Gain Formula is used to reduce an SFG to a single transfer function. The key steps are: 1) identify forward paths and their gains, 2) find individual loop gains, and 3) apply Mason's Gain Formula which factors in forward path and loop gains. Examples are provided of constructing SFGs from block diagrams and simultaneous equations. SFGs can solve systems more efficiently than block diagram reduction methods.

    Original Description:

    rr

    Original Title

    Lecture-3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses signal flow graphs (SFG), which represent systems of simultaneous equations through nodes and branches. An SFG consists of input, output, and mixed nodes connected by directed branches with transmittances. Mason's Gain Formula is used to reduce an SFG to a single transfer function. The key steps are: 1) identify forward paths and their gains, 2) find individual loop gains, and 3) apply Mason's Gain Formula which factors in forward path and loop gains. Examples are provided of constructing SFGs from block diagrams and simultaneous equations. SFGs can solve systems more efficiently than block diagram reduction methods.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    45 views20 pages

    On Signal Flow Graph Signal Flow Graph

    Uploaded by

    rub786
    The document discusses signal flow graphs (SFG), which represent systems of simultaneous equations through nodes and branches. An SFG consists of input, output, and mixed nodes connected by directed branches with transmittances. Mason's Gain Formula is used to reduce an SFG to a single transfer function. The key steps are: 1) identify forward paths and their gains, 2) find individual loop gains, and 3) apply Mason's Gain Formula which factors in forward path and loop gains. Examples are provided of constructing SFGs from block diagrams and simultaneous equations. SFGs can solve systems more efficiently than block diagram reduction methods.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 20

    Lecture

    On
    Signal Flow Graph
    Flow of PPT
    What is Signal Flow Graph (SFG)?
    Definitions of terms used in SFG
    Rules for drawing of SFG
    Masons Gain formula
    SFG from simultaneous eqns
    SFG from differential eqns
    Examples
    Solution of a problem by Block diagram reduction
    technique and SFG
    SFG from a given Transfer function
    Examples
    What is Signal Flow Graph?
    SFG is a diagram which represents a set of simultaneous
    equations.
    This method was developed by S.J.Mason. This method
    does nt require any reduction technique.
    It consists of nodes and these nodes are connected by a
    directed line called branches.
    Every branch has an arrow which represents the flow of
    signal.
    For complicated systems, when Block Diagram (BD) reduction
    method becomes tedious and time consuming then SFG
    is a good choice.
    Comparison of BD and SFG
    block diagram: signal flow graph:

    R(s) C (s) G(s)


    G(s)
    R(s) C (s)
    In this case at each step block diagram is to Only one time SFG is to be drawn and
    be redrawn. Thats why it is tedious method. then Masons gain formula is to be
    So wastage of time and space. evaluated.
    So time and space is saved.
    SFG
    Definition of terms required in SFG
    Node: It is a point representing a variable.
    x2 = t 12 x1 +t32 x3
    X3
    X1 t12 X2
    t32
    In this SFG there are 3 nodes.

    Branch : A line joining two nodes.


    X1 X2

    Input Node : Node which has only outgoing branches.

    X1 is input node.
    Output node/ sink node: Only incoming branches.

    Mixed nodes: Has both incoming and outgoing branches.

    Transmittance : It is the gain between two nodes. It is generally


    written on the branch near the arrow.

    t12 t23 t34

    X4
    X1 X2 X3

    t43
    Path : It is the traversal of connected branches in the direction
    of branch arrows, such that no node is traversed more than once.
    Forward path : A path which originates from the input node
    and terminates at the output node and along which no node
    is traversed more than once.
    Forward Path gain : It is the product of branch transmittances
    of a forward path.

    P 1 = G1 G2 G3 G4, P 2 = G5 G6 G7 G8
    Loop : Path that originates and terminates at the same node
    and along which no other node is traversed more than once.
    Self loop: Path that originates and terminates at the same
    node.
    Loop gain: it is the product of branch transmittances of a loop.
    Non-touching loops: Loops that dont have any common node
    or branch.

    L 1 = G2 H2 L 2 = H3

    L3= G7 H7
    Non-touching loops are L1 & L2, L1
    & L3, L2 &L3
    SFG terms representation
    input node (source)
    transmittance
    branch
    mixed node x4
    mixed node
    node d
    x1 a b path x3
    1
    x2 path loop
    forward x3
    c

    input node (source)


    Rules for drawing of SFG from
    Block diagram
    All variables, summing points and take off points are
    represented by nodes.
    If a summing point is placed before a take off point in the
    direction of signal flow, in such a case the summing point
    and take off point shall be represented by a single node.
    If a summing point is placed after a take off point in the
    direction of signal flow, in such a case the summing point
    and take off point shall be represented by separate nodes
    connected by a branch having transmittance unity.
    Masons Gain Formula
    A technique to reduce a signal-flow graph to a single transfer
    function requires the application of one formula.
    The transfer function, C(s)/R(s), of a system represented by a
    signal-flow graph is

    k = number of forward path


    Pk = the kth forward path gain
    = 1 ( loop gains) + ( non-touching loop gains taken two at a
    time) ( non-touching loop gains taken three at a time)+ so
    on .
    k = 1 (loop-gain which does not touch the forward path)
    Ex: SFG from BD
    EX: To find T/F of the given block
    diagram
    Identification of Forward Paths

    P 1 = 1.1.G1 .G 2 . G3. 1
    = G1 G2 G3

    P 2 = 1.1.G 2 . G 3 . 1
    = G 2 G3
    Individual Loops

    L 1 = G 1G 2 H 1 L 2 = - G 2G 3 H 2

    L 3 = - G 4H 2
    L4 =-G1G4

    L5 =-G1G2 G3
    Construction of SFG from simultaneous
    equations
    t21 t 23

    t31

    t32
    t33

    You might also like