Content deleted Content added
Undid revision 979691927 by Constant314 (talk) This is work by a university research group who have developed a testet open-source signal-flow graph tool for everyone interested. Please discuss with us before flagging it as spam. |
m →Basic flow graph concepts: Given the reason why s is used |
||
Line 61:
:<math>x_3=f_{31}(x_1)+f_{32}(x_2)+f_{33}(x_3) \ ,</math>
and now the functions ''f<sub>ij</sub>'' can be associated with the signal-flow branches ''ij'' joining the pair of nodes ''x<sub>i</sub>, x<sub>j</sub>'', rather than having general relationships associated with each node. A contribution by a node to itself like ''f<sub>33</sub>'' for ''x<sub>3</sub>'' is called a ''self-loop''. Frequently these functions are simply multiplicative factors (often called ''transmittances'' or ''gains''), for example, ''f<sub>ij</sub>(x<sub>j</sub>)=c<sub>ij</sub>x<sub>j</sub>'', where ''c'' is a scalar, but possibly a function of some parameter like the Laplace transform variable ''s''. Signal-flow graphs are very often used with Laplace-transformed signals,
=== Choosing the variables ===
| |||