DocumentCode
2618691
Title
On the optimal code generation for signal flow graph computation
Author
Wess, B.
Author_Institution
Inst. fuer Nachrichtentech. und Hochfrequenztech., Tech. Univ., Wien, Austria
fYear
1990
fDate
1-3 May 1990
Firstpage
444
Abstract
An algorithm is proposed for translating signal flow graphs into optimized code for asymmetric target machines. It is based on the dynamic programming principle, and its complexity is linear with respect to time. The method permits the construction of very efficient compilers generating code for general-purpose digital signal processors. The efficiency of the algorithm is demonstrated by several results of a compiler translating digital linear time-invariant systems, specified by a signal flow graph, into code for the processor TMS32020
Keywords
circuit CAD; digital signal processing chips; dynamic programming; graph theory; logic CAD; trees (mathematics); CAD; TMS32020; asymmetric target machines; compilers; digital signal processors; dynamic programming; general purpose DSP; optimal code generation; signal flow graph computation; Computer aided instruction; Delay; Digital signal processing; Digital signal processors; Dynamic programming; Flow graphs; Registers; Signal generators; Signal processing algorithms; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location
New Orleans, LA
Type
conf
DOI
10.1109/ISCAS.1990.112076
Filename
112076
Link To Document