M. Ade, ESAT, Katholieke Univ., Leuven, Heverlee, Belgium
The paper presents an algorithm to determine the smallest possible data buffer sizes for arbitrary synchronous data flow (SDF) applications, such that we can guarantee the existence of a deadlock free schedule. The presented algorithm fits in the design flow of GRAPE, an environment for the emulation and implementation of digital signal processing (DSP) systems on arbitrary target architectures, consisting of programmable DSP processors and FPGAs. Reducing the size of data buffers is of high importance when the application will be mapped on Field Programmable Gate Arrays (FPGA), since register resources are rather scarce.
Index Terms:
signal processing; logic CAD; software prototyping; synchronous data flow; deadlock free schedule; GRAPE; digital signal processing; arbitrary target architectures; Field Programmable Gate Arrays; heterogeneous targets; minimal size data buffers; DSP
Citation:
M. Ade, R. Lauwereins, J.A. Peperstrate, "Implementing DSP applications on heterogeneous targets using minimal size data buffers," rsp, pp.166, Seventh IEEE International Workshop on Rapid System Prototyping (RSP'96), 1996