ACM Home Page
Please provide us with feedback. Feedback
DSP address optimization using a minimum cost circulation technique
Full text Publisher SitePublisher Site PdfPdf (38 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 100 - 103  
Year of Publication: 1997
ISBN:0-8186-8200-0
Author
Catherine Gebotys  Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ont N2L 3G1 Canada
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

This paper presents a new approach to solving the DSP address assignment problem. A minimum cost circulation approach is used to efficiently generate high performance addressing code in polynomial time. Addressing code size improvements of up to 7 times are obtained, accounting for up to 1.6 times improvement in code size and performance of compiler-generated DSP code. Results also show that memory layout has a small effect on code size and performance when optimal addressing is used. This research is important for industry since this value-added technique can improve code size, power dissipation and performance, without increasing cost.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
4
 
5
 
6
TMS320C2x User's Guide, Texas Instruments Inc., 1993.
 
7
E.Lawler Combinatorial Optimization: Networks and Matroids Holt, Rinehart and Winston, 1976.
 
8
Brooke, Kendrick, Meeraus, "GAMS", Scientific Press, 1988.
 
9
 
10

CITED BY  12