Compact Form of Mason's Gain Formula for Signal Flow Graphs

2010 ◽  
Vol 47 (4) ◽  
pp. 393-403 ◽  
Author(s):  
V. C. Prasad

Mason's gain formula requires combining all paths and all loops judiciously. New techniques are presented in this paper to do this. All possible non-touching loop combinations can be generated systematically and represented compactly using a tree structure and/or factoring technique. Both numerator and denominator of the formula can be treated identically. The approach is simple enough to be used in teaching students Mason's gain formula as part of courses in control systems, digital signal processing, graph theory and applications, among others.

2019 ◽  
Vol 124 ◽  
pp. 03006
Author(s):  
M. V. Talanov ◽  
V. M. Talanov

The article describes the microprocessor system for various digital signal processing algorithms testing. The development of electric drive control systems is carried out with the usage of modeling systems such as, MATLAB/Simulink. Modern digital control systems are based on specialized digital signal microcontrollers. The present market offers evaluation boards, for example STM32F4DISCOVERY, which enables to connect a microcontroller to a personal computer. It makes possible to use the microcontroller as a part of the mathematical model of the control system. However, the designing of the control system simulation model and the program for the microprocessor is carried out in different programming environments. Thus, the software and hardware solution for testing programs for the microprocessor, which is a part of the control system, is relevant. This article deals with the designing of the modeling method in which the prototype program for the microprocessor is debugged as a part of the electric drive control system simulation model.


1976 ◽  
Vol 98 (4) ◽  
pp. 367-374
Author(s):  
K. R. Young ◽  
L. L. Hoberock ◽  
J. G. Thompson

A computer algorithm is developed that provides efficient means to compute transmittances directly from a signal flow graph or a block diagram. Signal flow graphs are cast as directed graphs described by adjacency matrices. Nonsearch computation, designed for compilers without symbolic capability, is used to identify all arcs that are members of simple cycles for use with Mason’s gain formula. The routine does not require the visual acumen of an interpreter to reduce the topology of the graph, and it is particularly useful for analyzing control systems described for computer analyses by means of interactive graphics.


Sign in / Sign up

Export Citation Format

Share Document