Schedule method for efficient memory addressing

Memory address allocation method for DSPs of indirect addressing with indexed auto-modification is proposed. At first, address auto-modification amounts for a given program are analyzed. And then address allocation of program variables are moved and shifted, so that both indexed and simple auto-modifications are effectively exploited. For further reduction in overhead codes, memory address allocation method coupled with computational reordering is proposed. The proposed methods are applied to the existing compiler, and generated codes prove their effectiveness.

[1]  B. Wess,et al.  DSP data memory layouts optimized for intermediate address pointer updates , 1998, IEEE. APCCAS 1998. 1998 IEEE Asia-Pacific Conference on Circuits and Systems. Microelectronics and Integrating Systems. Proceedings (Cat. No.98EX242).

[2]  Akinori Nishihara,et al.  Computational ordering of digital networks under pipeline constraints and its application to compiler for DSPs , 1989 .

[3]  Akinori Nishihara,et al.  Code optimization method for DSPs with multiple memory addressing registers and its application to compilers , 1996, Proceedings of Digital Processing Applications (TENCON '96).

[4]  Akinori Nishihara,et al.  Memory allocation method for indirect addressing with an index register , 2002, Asia-Pacific Conference on Circuits and Systems.