[AOC02] G. Araujo, G. Ottoni, and M. H. Cintra. Global array
reference allocation. ACM Trans. on Design Automation of
Electronic Systems, 7(2):336–357, April 2002.
[ARK00] S. Atri, J. Ramanujam, and M. T. Kandemir. Improving
offset assignment on embedded processors using transformations.
In Proc. Int. Conf. on High Performance Computing, pages
367–374, Bangalore, December 2000.
[ARK01] S. Atri, J. Ramanujam, and M. Kandemir. Improving offset
assignment for embedded processors. Lecture Notes in Computer
Science, 2017:158–??, 2001.
[ASM96] G. Araujo, A. Sudarsanam, and S. Malik. Instruction set
design and optimizations for address computation in DSP
architectures. In Proc. 8th Int. Symp. on System Synthesis, pages
102–107, La Jolla, November 1996.
[Bar92] D. H. Bartley. Optimizing stack frame accesses for processors
with restricted addressing modes. Software-Practice and
Experience, 22(2):101–110, February 1992.
[BLM98] A. Basu, R. Leupers, and P. Marwedel. Register-constrained
address computation in DSP programs. In DATE, pages 929–930,
Paris, February 1998.
[BLM99] A. Basu, R. Leupers, and P. Marwedel. Array index
allocation under register constraints. In Proc. Int. Conf. on VLSI
Design, Goa/India, 1999.
[CA00] M. H. Cintra and G. Araujo. Array reference allocation using
SSA-form and live range growth. In Proc ACM Workshop on
Languages, Compilers, and Tools for Embedded Systems, pages
48–62, Vancouver, June 2000.
[CA01] M. Cintra and G. Araujo. Array reference allocation using
SSA-form and live range growth. Lecture Notes in Computer
Science, 1985:48+, 2001.
[CK02] Y. Choi and T. Kim. Address assignment combined with
scheduling in DSP code generation. In Proc. 39th Design
Automation Conf., pages 225–230, New Orleans, June 2002.
[CK05] G. Chen and M. T. Kandemir. Optimizing address code
generation for array-intensive DSP applications. In Proc. 3nd
IEEE / ACM Int. Symp. on Code Generation and Optimization,
pages 141–152, San Jose, March 2005.
[CL98] W. Cheng and Y. Lin. Addressing optimization for
loop execution targeting DSP with auto-increment/decrement
architecture. In ISSS, pages 15–22, 1998.
[EK99] E. Eckstein and A. Krall. Minimizing cost of local variables
access for DSP-processors. In Y. A. Liu and R. Wilhelm, editors,
Workshop on Languages, Compilers and Tools for Embedded
Systems, volume 34(7), pages 20–27, Atlanta, 1999.
[ES03] E. Eckstein and B. Scholz. Addressing mode selection. In
IEEE/ACM Int. Symp. on Code Generation and Optimization,
pages 337–346, San Francisco, March 2003.
[Geb97] Catherine H. Gebotys. Dsp address optimization using a
minimum cost circulation technique. In Proc. IEEE Int. Conf. on
Computer-Aided Design, pages 100–103, 1997.
[GMCG00] S. Gupta, M. Miranda, F. Catthoor, and R. Gupta. Analysis
of high-level address code transformations for programmable
processors. In Proc. ACM Conf. on Design, Automation, and Test
in Europe, pages 9–13, Paris, March 2000.
[GMV+00] C. Ghez, M. Miranda, A. Vandecappelle, F. Catthoor, and
D. Verkest. Systematic high-level address code transformations
for piece-wise linear indexing: Illustration on a medical imaging
algorithm. In Proc. IEEE Workshop on Signal Processing Systems,
2000.
[HABT07] Johnny Huynh, Jose Nelson Amaral, Paul Berube, and
Sid-Ahmed-Ali Touati. Evaluation of offset assignment heuristics.
In Proc. International Conference on High Performance Embedded
Architectures and Compilers (HiPEAC 2007), LNCS 4367, Ghent,
Belgium, January 2007. Springer.
[HSN99] T. Haga, N. Sugino, and A. Nishihara. Memory allocation
method for an indirect addressing DSP with 2m modulo update
operations. In Proc. Int. Symp. on Intelligent Signal Processing
and Communication Systems, pages 605–608, Phuket, December
1999.
[ISNF94] S. Iimuro, N. Sugino, A. Nishihara, and N. Fujii. Code
optimization method utilizing memory addressing operation and
its application do DSP compiler. In Proc. IEEE Asia-Pacific
Conf. on Circuits and Systems, pages 151–156, Taipei, December
1994.
[KICR03] M. T. Kandemir, M. J. Irwin, G. Chen, and J. Ramanujam.
Address register assignment for reducing code size. In CC, pages
273–289, Warsaw, April 2003.
[KSN97] N. Kogure, N. Sugino, and A. Nishihara. Memory address
allocation method for a DSP with ±2 update operations in indirect
addressing. In Proc. Europ. Conf. on Circuit Theory and Design,
pages 1446–1451, Budapest, September 1997.
[KSN98a] N. Kogure, N. Sugino, and A. Nishihara. Memory address
allocation method for a DSP with ±2 update operations in indirect
addressing. In Proc. Asia-Pacific Conf. on Circuits and Systems,
pages 435–438, Chiangmai, November 1998.
[KSN98b] N. Kogure, N. Sugino, and A. Nishihara. Memory allocation
method for indirect addressing DSPs with ±2 update operations.
IEICE Trans. Fundamentals, e81-a(3):420–428, March 1998.
[KSN02] Y. Kaneko, N. Sugino, and A. Nishihara. Memory allocation
method for indirect addressing with index regioster. In
Proc. Asia-Pacific Conf. on Circuits and Systems, pages 199–202,
2002.
[LBM98] R. Leupers, A. Basu, and P. Marwedel. Optimized array
index computation in DSP programs. In Proc. Asia and
South Pacific Design Automation Conf., pages 87–92, Yokohama,
February 1998.
[LD98] Rainer Leupers and Fabian David. A uniform optimization
technique for offset assignment problems. In ISSS, pages 3–8, 1998.
[LDK+95] S. Liao, S. Devadas, K. Keutzer, S. Tjiang, and A. Wang.
Storage assignment to decrease code size. In Proc. ACM
Conf. on Programming Language Design and Implementation,
pages 186–195, June 1995.
[LDK+96a] S. Liao, S. Devadas, K. Keutzer, S. Tjiang, and A. Wang.
Storage assignment to decrease code size. ACM Trans. on
Programming Languages and Systems, 18(3):235–253, May 1996.
[LDK+96b] S. Y. Liao, S. Devadas, K. Keutzer, S. W. K. Tjiang, and
A. Wang. Storage assignment to decrease code size. ACM
Trans. on Programming Languages and Systems, 18(3):235–253,
May 1996.
[Leu03] R. Leupers. Offset assignment showdown: Evaluation of DSP
address code optimization algorithms. In 12th Int. Conf. on
Compiler Construction, pages 290–302, Warsaw, April 2003.
[LG03] B. Li and R. Gupta. Simple offset assignment in presence
of subword data. In Proc. ACM Int. Conf. on Compilers,
Architectures, and Synthesis for Embedded Systems, pages 12–23,
San Jose, October 2003.
[LKB+01] M. Lorenz, D. Kottman, S. Bashford, R. Leupers, and
P. Marwedel. Optimized address assignment for DSPs with
SIMD memory accesses. In Proc. Asia and South Pacific Design
Automation Conf., pages 415–420, January 2001.
[LKC01] Sungtaek Lim, Jihong Kim, and Kiyoung Choi.
Scheduling-based code size reduction in processors with indirect
addressing mode. In Proc. 9th Int. Symp. on Hardware/Software
Codesign, pages 165–169, Copenhagen, 2001.
[LM96] R. Leupers and P. Marwedel. Algorithms for address
assignment in DSP code generation. In Proc. IEEE Int. Conf. on
Computer-Aided Design, pages 109–112, San Jose, November 1996.
[LP03] J.-Y. Lee and I.-C. Park. Address code generation for DSP
instruction-set architectures. ACM Trans. on Design Automation
of Electronic Systems, 8(3):384–395, July 2003.
[LPJ96] C. Liem, P. Paulin, and A. Jerraya. Address calculation
for retargetable compilation and exploration of instruction-set
architectures. In Proc. 33rd ACM/IEEE Design Automation
Conf., pages 597–600, Las Vegas, June 1996.
[LPJ97] C. Liem, P. Paulin, and A. Jerraya. Compilation methods
for the address calculation units of embedded processor systems.
Design Automation for Embedded Systems, 2(1):61–77, January
1997.
[LYB+05] S. Leventhal, L. Yuan, N. K. Bambha, S. S. Bhattacharyya,
and G. Qu. DSP address optimization using evolutionary
algorithms. In 9th Int. Workshop on Software and Compilers for
Embedded Systems, pages 91–98, Dallas, September 2005.
[MCJM98] M. Miranda, F. Catthoor, M. Janssen, and H. De Man.
High-level address optimisation and synthesis techniques for
data-transfer intensive applications. IEEE Trans. on VLSI
Systems, 6(4):677–686, December 1998.
[OA02] G. Ottoni and G. Araujo. Efficient array reference allocation
for loops in embedded processors. In Proc. IEEE Workshop on
Embedded System Codesign, 2002.
[OKT06] O. Ozturk, M. T. Kandemir, and S. Tosun. An ilp based
approach to address code generation for digital signal processors.
In Proc. ACM Great Lakes Symp. on VLSI, pages 37–42,
Philadelphia, April 2006.
[OOAL03] D. Ottoni, G. Ottoni, G. Araujo, and R. Leupers. Improving
offset assignment through simultaneous variable coalescing. In 7th
Int. Workshop on Software and Compilers for Embedded Systems,
pages 285–297, Vienna, September 2003.
[OOAL06] Desiree Ottoni, Guilherme Ottoni, Guido Araujo, and
Rainer Leupers. Offset assignment using simultaneous variable
coalescing. ACM Trans. on Embedded Computing Systems
(TECS), 5(4):864–883, November 2006.
[ORA+01] G. Ottoni,
S. Rigo, G. Araujo, S. Rajagopalan, and S. Malik. Optimal live
range merge for address register allocation in embedded programs.
In Proc. Int. Conf. on Compiler Cosntruction, pages 274–288,
Genova, April 2001.
[PMC02] M. Palkovic, M. Miranda, and F. Catthoor. Systematic
power-performance trade-off in mpeg-4 by means of selective
function inlining steered by address optimization opportunities. In
Proc. ACM Conf. on Design, Automation, and Test in Europe,
pages 1072–1079, Paris, March 2002.
[PMCV01] M. Palkovic, M. Miranda, F. Catthoor, and D. Verkest.
High-level address condition expression transformations for design
exploration. In R. Merker and W. Schwarz, editors, System
Design Automation - Fundamentals, Priciples, Methods, Examples,
pages 56–64. Kluwer, March 2001.
[PMD+02] M. Palkovic, M. Miranda, K. Denolf,
P. Vos, and F. Catthoor. Systematic address and control code
transformations for performance optimisation of a mpeg-4 video
decoder. In Proc. IEEE 15th Int. Conf. on VLSI Design, pages
547–552, 2002.
[Rao98] A. Rao. Compiler optimizations for storage assignment on
embedded DSPs. Master’s thesis, University of Cincinnati, 1998.
[RKHK02a] J. Ramanujam, S. Krishnamurthy, J. Hong, and M. T.
Kandemir. Address code and arithmetic optimizations for
embedded systems. In Proc. Asia and South Pacific Design
Automation Conf., pages 619–624, Bangalore, January 2002.
[RKHK02b] J. Ramanujam, S. Krishnamurthy, J. Hong, and M. T.
Kandemir. Address code and arithmetic optimizations for
embedded systems. In Proc. IEEE 15th Int. Conf. on VLSI
Design, pages 619–624, 2002.
[RP99] A. Rao and S. Pande. Storage assignment optimizations
to generate compact and efficient code on embedded DSPs.
In SIGPLAN Conf. on Programming Language Design and
Implementation, pages 128–138, 1999.
[SFN99] N. Sugino, H. Funaki, and A. Nishihara. Memory address
allocation method for an indirect addressing DSP with
consideration of modification in local computational order. In
Proc. IEEE Int. Symp. on Circuits and Systems, volume 3, pages
496–499, Orlando, June 1999.
[SG03a] V. V. N. S. Sarvani and R. Govindarajan. Unified instruction
reordering and algebraic transformations for minimum cost offset
assignment. In 7th Int. Workshop on Software and Compilers for
Embedded Systems, pages 270–284, Vienna, September 2003.
[SG03b] N. Sharma and S. K. Gupta. Optimal stack slot assignment
in GCC. In GCC Developers Summit, May 2003.
[SINF96] N. Sugino, S. Iimuro, A. Nishihara, and N. Fujii. DSP code
optimization utilizing memory addressing operation. IEICE
Trans. Fundamentals, e79-a(8):1217–1223, August 1996.
[SLD97] A. Sudarsanam, S. Liao, and S. Devadas. Analysis and
evaluation of address arithmetic capabilities in custom DSP
architectures. In Proc. 34th ACM/IEEE Design Automation
Conf., Anaheim, June 1997.
[SMIN96] N. Sugino, H. Myiazaki,
S. IImuro, and A. Nishihara. Improved code optimization method
utilizing memory addressing and its application to compilers. In
Proc. IEEE Int. Symp. on Circuits and Systems, volume 2, pages
249–252, Atlanta, May 1996.
[SMN97] N. Sugino, H. Miyazaki, and A. Nishihara. DSP code
optimization methods utilizing addressing operations at the
codes without memory accesses. IEICE Trans. Fundamentals,
e80-a(12):2562–2571, December 1997.
[SMN01] N. Sugino, T. Matsuura, and A. Nishihara. New cost function
schemes in graph-based memory allocation method for an indirect
addressing DSP. In Proc. European Conf. on Circuit Theory and
Design, volume 2, pages 221–224, Espoo, August 2001.
[SN97] N. Sugino and A. Nishihara. Memory allocation methods for
a DSP with indirect addressing modes and their application to
compilers. In Proc. IEEE Int. Symp. on Circuits and Systems,
volume 4, pages 2585–2588, Hong Kong, June 1997.
[SN01] N. Sugino and A. Nishihara. Code optimization technique for
indirect addressing DSPs with consideration in local computational
order and memory allocation. IEICE Trans. Fundamentals,
e84-a(8):1960–1968, August 2001.
[SYN96] N. Sugino, S. Yoshida, and A. Nishihara. Code optimization
method for DSPs with multiple memory addressing registers and its
application to compilers. In Proc. IEEE TENCON, pages 619–624,
Perth, November 1996.
[UC01] S. Udayanarayanan and C. Chakrabarti. Address code
generation for digital signal processors. In Proc. 38th Design
Automation Conf., pages 353–358, Las Vegas, June 2001.
[Wes99] B. Wess. Minimization of data address computation overhead
of DSP programs. Design Automations for Embedded Systems,
4(2/3):167–185, March 1999.
[WF98] B. Wess and S. Fröhlich. DSP data memory layouts optimized
for intermediate address pointer updates. In Proc. Asia-Pacific
Conf. on Circuits and Systems, pages 451–454, Chiangmai,
November 1998.
[WG97a] B. Wess and M. Gotschlich. Constructing memory layouts for
address generation units supporting offset 2 access. In Proc. IEEE
Int. Conf. on Acoustics, Speech, and Signal Processing, volume 1,
pages 683–686, Munich, April 1997.
[WG97b] B. Wess and M. Gotschlich. Optimal DSP memory layout
generation as a quadratic assignment problem. In Proc. IEEE
Int. Symp. on Circuits and Systems, volume 3, pages 1712–1715,
Hong Kong, June 1997.
[WG97c] B. Wess and M. Gotschlich. Optimierungstechniken für
Adreßrecheneinheiten in DSPs. In Proc. DSP Deutschland,
Munich, September 1997.
[WZ04a] B. Wess and T. Zeitlhofer. Optimum address pointer
assignment for digital signal processors. In Proc. IEEE
Int. Conf. on Acoustics, Speech, and Signal Processing, volume 5,
pages 121–125, Montreal, May 2004.
[WZ04b] B. Wess and Thomas Zeitlhofer. On the phase coupling
problem between data memory layout generation and address
pointer assignment. In 8th Int. Workshop on Software and
Compilers for Embedded Systems, pages 152–166, Amsterdam,
September 2004.
[XSSX04] C. Xue, Z. Shao, E. H.-M. Sha, and B. Xiao. Optimizing
address assignment for scheduling embedded DSPs. In
Int. Conf. on Embedded and Ubiquitous Computing, pages 64–73,
Aizu-Wakamatsu City, Japan, August 2004.
[XSZ+06] C. Xue, Z. Shao, Q. Zhuge, B. Xiao, M. Liu, and E. H.-M.
Sha. Optimizing address assignment and scheduling for DSPs with
multiple functional units. IEEE Trans. on Circuits and Systems
II: Express Briefs, 53(9):976–980, September 2006.
[ZLP03] X. Zhuang, C. Lau,
and S. Pande. Storage assignment optimizations through variable
coalescence for embedded processors. In Proc. ACM Conf. on
Languages, Compilers, and Tools for Embedded Systems, pages
220–231, San Diego, June 2003.