Compact Procedural Synthesis of DSP Software Through Recursive Graph Decomposition
Compact Procedural Synthesis of DSP Software Through Recursive Graph Decomposition
Loading...
Files
Publication or External Link
Date
2006-01-13T20:09:31Z
Authors
Ko, M.
Murthy, P. K.
Bhattacharyya, S. S.
Advisor
Citation
DRUM DOI
Abstract
Synthesis of digital signal processing (DSP) software from dataflow-based
formal models is an effective approach for tackling the complexity of modern
DSP applications. In this paper, an efficient method is proposed for
applying subroutine call instantiation of module functionality when
synthesizing embedded software from a dataflow specification. The technique
is based on a novel recursive decomposition of subgraphs in a cluster
hierarchy that is optimized for low buffer size. Applying this technique,
one can achieve significantly lower buffer sizes than what is available for
minimum code size inlined schedules, which have been the emphasis of prior
software synthesis work. Furthermore, it is guaranteed that the number of
procedure calls in the synthesized program is polynomially bounded in the
size of the input dataflow graph, even though the number of module
invocations may increase exponentially. This recursive decomposition
approach provides an efficient means for integrating subroutine-based module
instantiation into the design space of DSP software synthesis. The
experimental results demonstrate a significant improvement in buffer cost,
especially for more irregular multi-rate DSP applications, with moderate
code and execution time overhead.