scispace - formally typeset
Journal ArticleDOI

Effects of a vanishing variable on the signal-flow graph

H.K. Kim
- 15 Nov 1968 - 
- Vol. 4, Iss: 23, pp 501-502
Reads0
Chats0
TLDR
Two rules are derived to reduce a signal-flow graph when one of the node variables vanishes, which render immediate uses in obtaining network parameters.
Abstract
Two rules are derived to reduce a signal-flow graph when one of the node variables vanishes. Since the vanishing of a node variable in the flow graph of a network corresponds to either opening or short-circuiting a specific network branch, the derived rules render immediate uses in obtaining network parameters.

read more