Generating Compact Code from Dataflow Specifications of Multirate DSP Algorithms

S.S. Bhattacharyya, J.T. Buck, S. Ha and Edward A. Lee

EECS Department
University of California, Berkeley
Technical Report No. UCB/ERL M93/36
May 1993

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/ERL-93-36.pdf

Synchronous dataflow (SDF) semantics are well-suited 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 firing patterns so that loops can be constructed in the target code. This paper establishes fundamental topological relationships between iteration and looping structures for a large class of practical SDF graphs. By modularizing different components of the scheduling objectives, such as minimizing data buffering requirements or increasing the number of data transfers that occur in registers, can be incorporated in manner that does not conflict with the goal of code compactness.

BibTeX citation:

@techreport{Bhattacharyya:M93/36,
    Author = {Bhattacharyya, S.S. and Buck, J.T. and Ha, S. and Lee, Edward A.},
    Title = {Generating Compact Code from Dataflow Specifications of Multirate DSP Algorithms},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1993},
    Month = {May},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/2342.html},
    Number = {UCB/ERL M93/36},
    Abstract = {Synchronous dataflow (SDF) semantics are well-suited 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 firing patterns so that loops can be constructed in the target code. This paper establishes fundamental topological relationships between iteration and looping structures for a large class of practical SDF graphs. By modularizing different components of the scheduling objectives, such as minimizing data buffering requirements or increasing the number of data transfers that occur in registers, can be incorporated in manner that does not conflict with the goal of code compactness.}
}

EndNote citation:

%0 Report
%A Bhattacharyya, S.S.
%A Buck, J.T.
%A Ha, S.
%A Lee, Edward A.
%T Generating Compact Code from Dataflow Specifications of Multirate DSP Algorithms
%I EECS Department, University of California, Berkeley
%D 1993
%@ UCB/ERL M93/36
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/2342.html
%F Bhattacharyya:M93/36