DSP address optimization using a minimum cost circulation technique
- 1 January 1997
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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.Keywords
This publication has 5 references indexed in Scilit:
- Power exploration for data dominated video applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient model for DSP code generation: performance, code size, estimated energyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Address calculation for retargetable compilation and exploration of instruction-set architecturesPublished by Association for Computing Machinery (ACM) ,1996
- Storage assignment to decrease code sizePublished by Association for Computing Machinery (ACM) ,1995
- Power analysis of embedded software: a first step towards software power minimizationIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1994