Minimum memory buffers in DSP applications

The authors compute the minimum required buffer sizes that still guarantee the construction of a deadlock-free static schedule in synchronous multirate data flow graphs. The results are applicable to the rapid prototyping of DSP algorithms.

[1]  Rudy Lauwereins,et al.  Rapid prototyping for DSP systems with multiprocessors , 1991, IEEE Design & Test of Computers.

[2]  E.A. Lee,et al.  Synchronous data flow , 1987, Proceedings of the IEEE.

[3]  Edward A. Lee,et al.  Software synthesis for DSP using ptolemy , 1995, J. VLSI Signal Process..