Static scheduling of synchronous data flow programs for digital signal processing
IEEE Transactions on Computers
Introduction to algorithms
Supercompilers for parallel and vector computers
Supercompilers for parallel and vector computers
A data locality optimizing algorithm
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Software synthesis for DSP using Ptolemy
Journal of VLSI Signal Processing Systems - Special issue on design environments for DSP
Looped schedules for dataflow descriptions of multirate signal processing algorithms
Formal Methods in System Design
Optimizing Supercompilers for Supercomputers
Optimizing Supercompilers for Supercomputers
Software Synthesis from Dataflow Graphs
Software Synthesis from Dataflow Graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimizing the implementation of real-time Simulink models onto distributed automotive architectures
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
This paper reviews a set of techniques for compiling dataflow-based, graphical programs for digital signal processing (DSP) applications into efficient implementations on programmable digital signal processors. This is a critical problem because programmable digital signal processors have very limited amounts of on-chip memory and the speed power, and financial cost penalties for using off-chip memory are often prohibitively high for the types of applications, typically embedded systems, in which these processors are used. The compilation techniques described in this paper are developed for the synchronous dataflow model of computation, a model that has found widespread use for specifying and prototyping DSP systems.