Proceedings Paper
Temporal Localization And Systolization Of Signal Flow Graph (SFG) Computing Networks| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper Abstract
This paper addresses the theoretical and algorithmic issues related to optimal temporal localization (and systolization) of Signal Flow Graph (SFG) computing networks. Based on a cut-set localization procedure we propose an algorithm that computes the optimal localization of an SFG. The basic algorithm is then extended so that it can be used with hierarchically specified SFG's, thus significantly improving the computational efficiency. The algorithms can be easily coded and incorporated into a computer-aided-design (CAD) system.
Paper Details
Date Published: 28 November 1984
PDF: 9 pages
Proc. SPIE 0495, Real-Time Signal Processing VII, (28 November 1984); doi: 10.1117/12.944009
Published in SPIE Proceedings Vol. 0495:
Real-Time Signal Processing VII
Keith Bromley, Editor(s)
PDF: 9 pages
Proc. SPIE 0495, Real-Time Signal Processing VII, (28 November 1984); doi: 10.1117/12.944009
Show Author Affiliations
S. Y. Kung, University of Southern California (United States)
S. C. Lo, University of Southern California (United States)
S. C. Lo, University of Southern California (United States)
J. Annevelink, Delft University of Technology (Netherlands)
Published in SPIE Proceedings Vol. 0495:
Real-Time Signal Processing VII
Keith Bromley, Editor(s)
© SPIE. Terms of Use
