Optimizing DSP flow graphs via schedule-based multidimensional retiming

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 l...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1996-01, Vol.44 (1), p.150-155
Main Authors: Passos, N.L., Sha, E.H.-M., Bass, S.C.
Format: Article
Language:English
Subjects:
Applied sciences
Delay
Digital signal processing
Exact sciences and technology
Flow graphs
Information, signal and communications theory
Miscellaneous
Multidimensional signal processing
Multidimensional systems
Parallel processing
Pipelines
Processor scheduling
Signal and communications theory
Signal processing algorithms
Telecommunications and information theory
Timing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.482026