Signal flow graphs for network simulation

Abstract
This paper describes an interactive graphical use of signal flow graphs (Mason graphs) to simulate linear networks in either the time or frequency domain. The program allows the user to describe, manipulate, and compute signal flow graphs for up to 64 nodes on a screen. Since many readers may not be familiar with these graphs, the paper includes a general introduction to them. The program is written in FORTRAN IV and runs on a Hewlett-Packard 21 MX minicomputer. A low-cost, low- resolution (256x 256 points) TV display is used as the input and output device.