High performance DSP software using data-flow graph transformations

The paper presents an overview of transformations for DSP programs given in form of coarse-grain data-flow graphs. The goal is to produce a functionally equivalent data-flow graph with improved characteristics, regarding modeling and/or implementation of DSP software. Retiming, unfolding, vectorization, clustering as well as node/arc set extensions are discussed. As an example, an application of the presented transformations to the design of a satellite receiver is presented.<<ETX>>

[1]  Jan M. Rabaey,et al.  Scheduling of DSP programs onto multiprocessors for maximum throughput , 1993, IEEE Trans. Signal Process..

[2]  Keshab K. Parhi,et al.  Static Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding , 1991, IEEE Trans. Computers.

[3]  Heinrich Meyr,et al.  High-Level Software Synthesis for the Design of Communication Systems , 1993, IEEE J. Sel. Areas Commun..

[4]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

[5]  Shuvra S. Bhattacharyya,et al.  Compiling dataflow programs for digital signal processing , 1995 .

[6]  Heinrich Meyr,et al.  Optimum vectorization of scalable synchronous dataflow graphs , 1993, Proceedings of International Conference on Application Specific Array Processors (ASAP '93).

[7]  R. Karp,et al.  Properties of a model for parallel computations: determinacy , 1966 .

[8]  Edwin H.-M. Sha,et al.  Unfolding and retiming data-flow DSP programs for RISC multiprocessor scheduling , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[9]  Robert K. Brayton,et al.  Retiming and resynthesis: optimizing sequential networks with combinational techniques , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Heinrich Meyr,et al.  Retiming of DSP programs for optimum vectorization , 1994, Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing.

[11]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.

[12]  Heinrich Meyr,et al.  Multiprocessor scheduling with a priori node assignment , 1994, Proceedings of 1994 IEEE Workshop on VLSI Signal Processing.

[13]  Amir Pnueli,et al.  Marked Directed Graphs , 1971, J. Comput. Syst. Sci..