Temporal Localization and Systolization of Signal Flow Graph (SFG) Computing Networks

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

Research output: Contribution to journalArticle

2 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)58-66
Number of pages9
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume495
DOIs
StatePublished - Nov 28 1984
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Temporal Localization and Systolization of Signal Flow Graph (SFG) Computing Networks'. Together they form a unique fingerprint.

Cite this