DocumentCode
2209097
Title
Optimized DSP assembly code generation starting from homogeneous atomic data flow graphs
Author
Wess, Bernhard ; Kreuzer, Werner
Author_Institution
Inst. fur Nachrichtentech. & Hochfrequenztech., Tech. Univ. Wien, Austria
Volume
2
fYear
1995
fDate
13-16 Aug 1995
Firstpage
1268
Abstract
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
Keywords
assembly language; data flow graphs; digital signal processing chips; optimisation; trees (mathematics); DSP assembly code generation; NP-complete problem; O(n) algorithm; expression tree; global optimized instruction code; homogeneous atomic data flow graph; Assembly; Delay; Digital signal processing; Dynamic programming; Flow graphs; Lattices; Scheduling; Search problems; Signal processing algorithms; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1995., Proceedings., Proceedings of the 38th Midwest Symposium on
Conference_Location
Rio de Janeiro
Print_ISBN
0-7803-2972-4
Type
conf
DOI
10.1109/MWSCAS.1995.510327
Filename
510327
Link To Document