Algorithms for symbolic reduction of signal flow graphs

Maciej Szymkat

Mathematics and Computers in Simulation (MATCOM), 1996, vol. 42, issue 4, 675-684

Abstract: In this paper certain properties of algorithms used in symbolic manipulation on signal flow graphs are investigated. The rule-based approach and Mason's formula are compared with respect to preservation of minimal rational representation. It is shown by counter example that rule-based method does not possess this property if factor cancellations are allowed at elementary operation level only. A new efficient algorithm is proposed in which this problem is resolved.

Keywords: Signal flow graph reduction; Symbolic calculations; Continuous and discrete dynamical systems; Symbolic-numerical devices (search for similar items in EconPapers)
Date: 1996
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475496000420
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:42:y:1996:i:4:p:675-684

DOI: 10.1016/S0378-4754(96)00042-0

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().