Translator Disclaimer
28 November 1984 Temporal Localization And Systolization Of Signal Flow Graph (SFG) Computing Networks
Author Affiliations +
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.
© (1984) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
S. Y. Kung, S. C. Lo, and J. Annevelink "Temporal Localization And Systolization Of Signal Flow Graph (SFG) Computing Networks", Proc. SPIE 0495, Real-Time Signal Processing VII, (28 November 1984); https://doi.org/10.1117/12.944009
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top