![]() |
Home |
CS |
Sites |
ABdA |
Help |
![]() |
WEEK 04: SIGNAL FLOW GRAPHS Sections: Configuration | BD to SFG | Algebra | Mason's Gain Rule | Example | Student's Corner Signal Flow Graph Definition. A diagram which represents a set of simultaneous equations simplifying a complex network in which nodes are connected by directed branches. The graph basically consists of lines and arrows and the transforms of each component written near the line. Signal flow graphs are employed, especially and generally, for multiple input, multiple output control systems. Sections: Configuration | BD to SFG | Algebra | Mason's Gain Rule | Example | Student's Corner Source Nodes. Also called, independent nodes or independent variables and have only outgoing branches. In the diagram above, nodes U and V are source nodes. Sink Nodes. Also called, dependent nodes or dependent variables and have only incoming branches. In the same diagram above, nodes Y and X are sink nodes. Mixed Nodes. Consists of independent and dependent nodes or variables. In the same diagram above, node W is a mixed node. Path. Any connected sequence of branches whose arrows flow in the same direction. A forward path is a succession of branches in which a node appears only once. In the diagram above, the path is simply following the arrow that goes from R to G to Y. Loop. Any connected sequence of branches whose arrows flow from one particular node and back to that particular node. In the diagram above, the loop is simply following the arrow that goes from node a, to transmittance at G, to node b, to transmittance at -H and back to node a, from where it began. Sections: Configuration | BD to SFG | Algebra | Mason's Gain Rule | Example | Student's Corner Translation of Block Diagram to Signal Flow Graph Methods. Sections: Configuration | BD to SFG | Algebra | Mason's Gain Rule | Example | Student's Corner 1. Addition. y = a x. 2. Transmission. 3. Series/Cascade 4. Parallel 5. Node Absorption 5. Feedback Path |