Optimized DSP assembly code generation starting from homogeneous atomic data flow graphs
Bernhard Wess, W. Kreuzer · 2002
The problem of translating graphs into optimal instruction code is NP-complete even for very simple target machine models. On the other hand, O(n) algorithms are available for translating expression trees into optimal instruction code. The purpose of this paper is to show that by transforming graphs into constrained expression trees, global optimized instruction code can be produced based on tree algorithms.