Looped Schedules for Dataflow Descriptions of Multirate DSP Algorithms

S.S. Bhattacharyya and Edward A. Lee

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

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

The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments for multirate signal processing applications. In this paradigm, the repetition of computations is specified by the relative\ rates at which the computations consume and produce data. This implicit specification of iteration allows a compiler to easily explore alternative nested loops structures for the target code with respect to their effects on code size, buffering requirements and throughput. In this paper, we develop important relationships between the SDF description of an algorithm and the range of looping structures offered by this description, and we discuss how to improve code efficiency by applying these relationships.

BibTeX citation:

@techreport{Bhattacharyya:M93/37,
    Author = {Bhattacharyya, S.S. and Lee, Edward A.},
    Title = {Looped Schedules for Dataflow Descriptions of Multirate DSP Algorithms},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1993},
    Month = {May},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/2346.html},
    Number = {UCB/ERL M93/37},
    Abstract = {The synchronous dataflow (SDF) programming paradigm has been used extensively in design environments for multirate signal processing applications.  In this paradigm, the repetition of computations is specified by the relative\ rates at which the computations consume and produce data. This implicit specification of iteration allows a compiler to easily explore alternative nested loops structures for the target code with respect to their effects on code size, buffering requirements and throughput. In this paper, we develop important relationships between the SDF description of an algorithm and the range of looping structures offered by this description, and we discuss how to improve code efficiency by applying these relationships.}
}

EndNote citation:

%0 Report
%A Bhattacharyya, S.S.
%A Lee, Edward A.
%T Looped Schedules for Dataflow Descriptions of Multirate DSP Algorithms
%I EECS Department, University of California, Berkeley
%D 1993
%@ UCB/ERL M93/37
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1993/2346.html
%F Bhattacharyya:M93/37