| Paper: | DISPS-P2.7 | ||
| Session: | Fast Algorithms | ||
| Time: | Friday, May 21, 09:30 - 11:30 | ||
| Presentation: | Poster | ||
| Topic: | Design and Implementation of Signal Processing Systems: Design Methodology and Rapid Prototyping | ||
| Title: | OPTIMUM ADDRESS POINTER ASSIGNMENT FOR DIGITAL SIGNAL PROCESSORS | ||
| Authors: | Bernhard Wess; Vienna University of Technology | ||
| Thomas Zeitlhofer; Vienna University of Technology | |||
| Abstract: | Generating optimum data memory layouts and address pointer assignments for digital signal processors are hard combinatorial optimization problems. In this paper, it is shown that for fixed memory layouts optimum address pointer assignment can be generated. The computational complexity depends exponentially just on the number of address pointers. The proposed technique is applied to a large benchmark suite. For three address pointers optimum solutions can be generated in almost all cases (99.98) within one second. Since a large number of address pointers may be intractable, an additional heuristic pruning technique with nearly optimum performance is proposed. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops