Optimized software synthesis for digital signal processing algorithms: an evolutionary approach

Abstract

Based on the model of synchronous data flow (SDF), so-called single appearance schedules are known to provide memory-optimal schedules. Among these, the problem of buffer memory optimization is treated: (1) an evolutionary algorithm (EA) is applied to efficiently explore the (in general) exponential search space of actor firing orders; (2) for each order, the buffer costs are evaluated by applying a dynamic programming post-optimization step (GDPPO).