Optimizing DSP flow graphs via schedule-based multidimensionalretiming

  • Authors:
  • N.L. Passos;E.H.-M. Sha;S.C. Bass

  • Affiliations:
  • Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN;-;-

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 1996

Quantified Score

Hi-index 35.68

Visualization

Abstract

Transformation techniques are usually applied to get optimal execution rates in parallel and/or pipeline systems. The retiming technique is a common and valuable tool in optimizing 1-D signal processing applications, represented by flow graphs. Such transformation can maximize the parallelism of a loop body. Few results on retiming have been obtained for multidimensional (MD) systems. The article develops a novel framework, which consists of a MD retiming technique that considers the final schedule as part of the optimization process. To the author's knowledge, this is the first retiming algorithm on general MD flow graphs