Signal Flow Graphs and Network Topology

Why it matters

Signal Flow Graphs (SFG) and Network Topology are crucial for analyzing complex electrical networks and systems. They provide a visual and mathematical way to understand the relationships between different components, making it easier to design and troubleshoot circuits.

Key ideas

• Signal Flow Graphs (SFG): A graphical representation of a set of linear algebraic equations. It consists of nodes and directed branches, where nodes represent system variables and branches represent the functional dependencies between these variables.
• Mason's Gain Formula: Used to find the overall gain of a system represented by a signal flow graph. It simplifies the process of solving complex networks.
• Network Topology: Refers to the arrangement of various elements (links, nodes, etc.) in a network. It helps in understanding the structure and behavior of the network.
• Circuit graph topology: A connected graph with n nodes and b branches has n − 1 tree branches and b − n + 1 independent loops. Cutsets support KCL equations and loops support KVL equations; a signal-flow graph is a different representation of equations.

Formulas

• T = Σ(P_k * Δ_k) / Δ
  • T: Overall transfer function or gain
  • P_k: Gain of the k-th forward path
  • Δ: Determinant of the graph (1 - sum of all individual loop gains + sum of gain products of all possible combinations of two non-touching loops - ...)
  • Δ_k: Cofactor obtained by excluding every loop that touches the k-th forward path

Worked example

Consider the equations x = 2r − 0.5y and y = 3x. The graph has forward path r → x → y with gain P1 = 2 × 3 = 6, and feedback loop x → y → x with gain L1 = 3 × (−0.5) = −1.5. Δ = 1 − L1 = 2.5. The loop touches the forward path, so it is excluded from Δ1, leaving Δ1 = 1. Mason’s formula gives y/r = 6 × 1/2.5 = 2.4. Direct substitution checks the result: y = 3(2r − 0.5y), hence 2.5y = 6r. The absence of non-touching loop pairs does not imply Δk = Δ. Each loop’s relationship to the particular forward path matters.

Common mistakes

• Confusing the direction of branches in signal flow graphs.
• Incorrectly calculating the determinant Δ by missing loop gains or non-touching loops.
• Forgetting to consider all forward paths in Mason's Gain Formula.

For GATE EC

Questions often involve calculating the overall gain of a system using Mason's Gain Formula or analyzing different network topologies. Practice identifying forward paths, loops, and calculating determinants in signal flow graphs.

Quick check

1. What is a signal flow graph?
2. How many independent loops are in a connected circuit graph?
3. What is Mason's Gain Formula used for?

Answers: 1. A graphical representation of a set of linear algebraic equations. 2. b − n + 1 for b branches and n nodes. 3. To find the overall gain of a system represented by a signal flow graph.