| contributor author | K. R. Young | |
| contributor author | L. L. Hoberock | |
| contributor author | J. G. Thompson | |
| date accessioned | 2017-05-08T23:00:19Z | |
| date available | 2017-05-08T23:00:19Z | |
| date copyright | December, 1976 | |
| date issued | 1976 | |
| identifier issn | 0022-0434 | |
| identifier other | JDSMAA-26041#367_1.pdf | |
| identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/88430 | |
| description abstract | 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. | |
| publisher | The American Society of Mechanical Engineers (ASME) | |
| title | An Algorithm for Automatic Reduction of Complex Signal Flow Graphs | |
| type | Journal Paper | |
| journal volume | 98 | |
| journal issue | 4 | |
| journal title | Journal of Dynamic Systems, Measurement, and Control | |
| identifier doi | 10.1115/1.3427053 | |
| journal fristpage | 367 | |
| journal lastpage | 374 | |
| identifier eissn | 1528-9028 | |
| keywords | Algorithms | |
| keywords | Flow (Dynamics) | |
| keywords | Signals | |
| keywords | Computers | |
| keywords | Computation | |
| keywords | Cycles | |
| keywords | Formulas | |
| keywords | Topology AND Control systems | |
| tree | Journal of Dynamic Systems, Measurement, and Control:;1976:;volume( 098 ):;issue: 004 | |
| contenttype | Fulltext | |
