Temporal Localization And Systolization Of Signal Flow Graph (SFG) Computing Networks

S. Y. Kung; S. C. Lo; J. Annevelink

doi:10.1117/12.944009

28 November 1984 Temporal Localization And Systolization Of Signal Flow Graph (SFG) Computing Networks

S. Y. Kung, S. C. Lo, J. Annevelink

Proceedings Volume 0495, Real-Time Signal Processing VII; (1984) https://doi.org/10.1117/12.944009
Event: 28th Annual Technical Symposium, 1984, San Diego, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available