Compute overall gain of complicated diagrams.
Signal flow graphs represent equations as nodes and branches with gains; Mason's gain formula T=Σ(P_kΔ_k)/Δ, with Δ=1-ΣL+ΣLL-… handles complex networks without algebraic reduction. Equivalent to block diagrams.
Mason's formula finds the transfer function of a multi-loop feedback system quickly.
Mason's rule gives the overall gain of a complex signal flow graph without repeated block reduction, which saves effort on large systems.
Compute overall gain of complicated diagrams.
Mason's rule gives the overall gain of a complex signal flow graph without repeated block reduction, which saves effort on large systems.
A path from input to output that does not revisit any node, and each forward path contributes its gain to the total.
The product of gains around a closed loop, and Mason's rule uses these loops to correct the denominator.
Typical applications include computing the gain from input to output of a multi-loop control system, checking a block diagram reduction with a second method and finding the transfer function of an electronic network with several feedback paths.
Study "Block diagrams" first (topic 20 of 101 in Signals, Control & Comms). It covers the groundwork this topic builds on.
Forward paths and loops. Non-touching loops. Systematic for multi-loop systems.
Mason's formula finds the transfer function of a multi-loop feedback system quickly.
The next topic is "Filtering concept", which builds directly on this one.
It is classed as Beginner in Signals, Control & Comms (topic 21 of 101). It is an entry-level topic. It relies only on basic school mathematics and the ideas introduced earlier in this discipline.
Want to practise? Open the interactive course for quick checks, quizzes, simulations and progress tracking.