Data memory minimisation for synchronous data flow graphs emulated on DSP-FPGA targets

The paper presents an algorithm to determine the close-to-smallestpossible data buffer sizes for arbitrary synchronous dataflow (SDF) applications, such that we can guarantee the existenceof a deadlock free schedule. The presented algorithm fits inthe design flow of GRAPE, an environment for the emulation andimplementation of digital signal processing (DSP) systems onarbitrary target architectures, consisting of programmable DSPprocessors and FPGAs. Reducing the size of data buffers is ofhigh importance when the application will be mapped on FieldProgrammable Gate Arrays (FPGA), since register resources arerather scarce.

[1]  Rudy Lauwereins,et al.  Hardware-software codesign with GRAPE , 1995, Proceedings Sixth IEEE International Workshop on Rapid System Prototyping. Shortening the Path from Specification to Prototype.

[2]  Edward A. Lee,et al.  Ptolemy: A Framework for Simulating and Prototyping Heterogenous Systems , 2001, Int. J. Comput. Simul..

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

[4]  M. Engels,et al.  Grape-II: A System-Level Prototyping Environment for DSP Applications , 1995, Computer.

[5]  Edward A. Lee,et al.  Converting graphical DSP programs into memory constrained software prototypes , 1995, Proceedings Sixth IEEE International Workshop on Rapid System Prototyping. Shortening the Path from Specification to Prototype.

[6]  Jean A. Peperstraete,et al.  Cycle-static dataflow , 1996, IEEE Trans. Signal Process..

[7]  Rudy Lauwereins,et al.  Minimum memory buffers in DSP applications , 1994 .

[8]  Edward A. Lee.  Consistency in Dataflow Graphs , 1991, IEEE Trans. Parallel Distributed Syst..

[9]  Rudy Lauwereins,et al.  Buffer memory requirements in DSP applications , 1994, Proceedings of IEEE 5th International Workshop on Rapid System Prototyping.