Publications
Detailed Information
Generating Compact Code from Dataflow Specifications of Multirate Signal Processing Algorithms
Cited 15 time in
Web of Science
Cited 25 time in Scopus
- Authors
- Issue Date
- 1995-03
- Citation
- IEEE Trans. Circ. Syst., vol. 42, pp. 138-150, Mar. 1995
- Keywords
- Signal processing ; Digital processing ; Data flow ; Synchronous ; Assembler ; Code generation
- Abstract
- Synchronous dataflow (SDF) semantics are wellsuited to representing and compiling multirate signal processing algorithms. A key to this match is the ability to cleanly express iteration without overspecifying the execution order of computations, thereby allowing efficient schedules to be constructed. Due to limited program memory, it is often desirable to translate the iteration in an SDF graph into groups of repetitive Wring patterns so that loops can be constructed in the target code. This paper establishes fundamental topological relationships between iteration and looping in SDF graphs, and presents a scheduling framework that provably synthesizes the most compact looping structures for a large class of practical SDF graphs. By modularizing different components of the scheduling framework, and establishing their independence, we show how other scheduling objectives, such as minimizing data buffering requirements or increasing the number of data transfers that occur in registers, can be incorporated in a manner that does not conflict with the goal of code compactness.
- ISSN
- 1057-7122
- Language
- English
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.