Minimum memory buffers in DSPapplications

M. Adé, R. Lauwereins, Jan A. Peperstraete · Electronics Letters · 1994

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.

Read the paper · More papers on PaperTik