# Control Systems/Signal Flow Diagrams

## Contents

- 1 Signal-flow graphs
- 2 Examples
- 2.1 Solving a signal-flow graph by systematic reduction : Two interlocking loops
- 2.1.1 Removing edge c from x2 to x3
- 2.1.2 Removing node x2 and its inflows
- 2.1.3 Removing edge e from x3 to x1
- 2.1.4 Remove edge d from x3 to x4
- 2.1.5 Removing self-loop at x1
- 2.1.6 Removing self-loop at x4
- 2.1.7 Remove edge from x4 to x1
- 2.1.8 Remove outflow from x4 to x
_{out} - 2.1.9 Eliminating self-loop at x1
- 2.1.10 Eliminating outflow from x1, then eliminating x1 and its inflows
- 2.1.11 Simplifying the gain expression

- 2.2 Solving a signal-flow graph by systematic reduction: Three equations in three unknowns

- 2.1 Solving a signal-flow graph by systematic reduction : Two interlocking loops
- 3 Electrical engineering: Construction of a flow graph for a RC circuit

## Signal-flow graphs[edit]

**Signal-flow graphs** are another method for visually representing a system. Signal Flow Diagrams are especially useful, because they allow for particular methods of analysis, such as **Mason's Gain Formula**.

Signal flow diagrams typically use curved lines to represent wires *and systems*, instead of using lines at right-angles, and boxes, respectively. Every curved line is considered to have a multiplier value, which can be a constant gain value, or an entire transfer function. Signals travel from one end of a line to the other, and lines that are placed in series with one another have their total multiplier values multiplied together (just like in block diagrams).

Signal flow diagrams help us to identify structures called "loops" in a system, which can be analyzed individually to determine the complete response of the system.

### Forward Paths[edit]

A **forward path** is a path in the signal flow diagram that connects the input to the output without touching any single node or path more than once. A single system can have multiple forward paths.

### Loops[edit]

A **loop** is a structure in a signal flow diagram that leads back to itself. A loop does not contain the beginning and ending points, and the end of the loop is the same node as the beginning of a loop.

Loops are said to touch if they share a node or a line in common.

The **Loop gain** is the total gain of the loop, as you travel from one point, around the loop, back to the starting point.

### Delta Values[edit]

The Delta value of a system, denoted with a Greek Δ is computed as follows:

Where:

- A is the sum of all individual loop gains
- B is the sum of the products of all the pairs of non-touching loops
- C is the sum of the products of all the sets of 3 non-touching loops
- D is the sum of the products of all the sets of 4 non-touching loops
- et cetera.

If the given system has no pairs of loops that do not touch, for instance, B and all additional letters after B will be zero.

### Mason's Rule[edit]

**Mason's rule** is a rule for determining the gain of a system. Mason's rule can be used with block diagrams, but it is most commonly (and most easily) used with signal flow diagrams.

If we have computed our delta values (above), we can then use **Mason's Gain Rule** to find the complete gain of the system:

[Mason's Rule]

Where M is the total gain of the system, represented as the ratio of the output gain (y_{out}) to the input gain (y_{in}) of the system. M_{k} is the gain of the k^{th} forward path, and Δ_{k} is the loop gain of the k^{th} loop.

## Examples[edit]

### Solving a signal-flow graph by systematic reduction : Two interlocking loops[edit]

This example shows how a system of five equations in five unknowns is solved using systematic reduction rules. The independent variable is . The dependent variables are , , , , . The coefficients are labeled .

Here is the starting flowgraph:

The steps for solving follow.

#### Removing edge c from x2 to x3[edit]

#### Removing node x2 and its inflows[edit]

has no outflows, and is not a node of interest.

#### Removing edge e from x3 to x1[edit]

#### Remove edge d from x3 to x4[edit]

Node has no outflows and is not a node of interest. It is deleted along with its inflows.

#### Removing self-loop at x1[edit]

#### Removing self-loop at x4[edit]

#### Remove edge from x4 to x1[edit]

#### Remove outflow from x4 to x_{out}[edit]

's outflow is then eliminated: is connected directly to using the product of the gains from the two edges replaced.

is not a variable of interest; thus, its node and its inflows are eliminated.

#### Eliminating self-loop at x1[edit]

#### Eliminating outflow from x1, then eliminating x1 and its inflows[edit]

is not a variable of interest; and its inflows are eliminated

#### Simplifying the gain expression[edit]

```
```

### Solving a signal-flow graph by systematic reduction: Three equations in three unknowns[edit]

This example shows how a system of three equations in three unknowns is solved using systematic reduction rules.

The independent variables are , , . The dependent variables are , , . The coefficients are labeled . The steps for solving follow:

## Electrical engineering: Construction of a flow graph for a RC circuit[edit]

This illustration shows the physical connections of the circuit. Independent voltage source S is connected in series with a resistor R and capacitor C. The example is developed from the physical circuit equations and solved using signal-flow graph techniques. Polarity is important:

- S is a source with the positive terminal at
**N**and the negative terminal at_{1}**N**_{3} - R is a resistor with the positive terminal at
**N**and the negative terminal at_{1}**N**_{2} - C is a capacitor with the positive terminal at
**N**and the negative terminal at_{2}**N**._{3}

The unknown variable of interest is the voltage across capacitor **C**.

Approach to the solution:

- Find the set of equations from the physical network. These equations are acausal in nature.
- Branch equations for the capacitor and resistor. The equations will be developed as transfer functions using Laplace transforms.
- Kirchhoff's voltage and current laws

- Build a signal-flow graph from the equations.
- Solve the signal-flow graph.

### Branch equations[edit]

The branch equations are shown for R and C.

#### Resistor R (Branch equation )[edit]

The resistor's branch equation in the time domain is:

In the Laplace-transformed signal space:

#### Capacitor C (Branch equation )[edit]

The capacitor's branch equation in the time domain is:

Assuming the capacitor is initially discharged, the equation becomes:

Taking the derivative of this and multiplying by *C* yields the derivative form:

In the Laplace-transformed signal space:

### Kirchhoff's laws equations[edit]

#### Kirchhoff's Voltage Law equation [edit]

This circuit has only one independent loop. Its equation in the time domain is:

In the Laplace-transformed signal space:

#### Kirchhoff's Current Law equations [edit]

The circuit has three nodes, thus three Kirchhoff's current equations (expresses here as the currents flowing from the nodes):

In the Laplace-transformed signal space:

A set of independent equations must be chosen. For the current laws, it is necessary to drop one of these equations. In this example, let us choose .

### Building the signal-flow graph[edit]

We then look at the inventory of equations, and the signals that each equation relates:

Equation | Signals |
---|---|

The next step consists in assigning to each equation a signal that will be represented as a node. Each independent source signal is represented in the signal-flow graph as a source node, therefore no equation is assigned to the independent source . There are many possible valid signal flow graphs from this set of equations. An equation must only be used once, and the variables of interest must be represented.

Equation | Signals | Assigned signal node |
---|---|---|

### The resulting flow graph is then drawn[edit]

The next step consists in solving the signal-flow graph.

Using either Mason or systematic reduction, the resulting signal flow graph is: