Algorithms for address assignment in DSP code generation
Rainer Leupers, Peter Marwedel
Abstract
Rainer Leupers, Peter Marwedel
Abstract
Abstract { This paper presents DSP code optimization techniques, which originate from dedicated memory address generation hardware. We de ne a generic model of DSP address generation units. Based on this model, we present e cient heuristics for computing memory layouts for program variables, which optimize utilization of parallel address generation units. Improvements and generalizations of previous work are described, and the e cacy of the proposed algorithms is demonstrated through experimental evaluation. 1Introduction & related work Design of embedded VLSI systems in form of heterogeneous single-chip architectures, comprising both hardware and software components, raises new demands on electronic CAD tools. Among the most challenging
OpenAlex reports 148 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract { This paper presents DSP code optimization techniques, which originate from dedicated memory address generation hardware. We de ne a generic model of DSP address generation units. Based on this model, we present e cient heuristics for computing memory layouts for program variables, which optimize utilization of parallel address generation units. Improvements and generalizations of previous work are described, and the e cacy of the proposed algorithms is demonstrated through experimental evaluation. 1Introduction & related work Design of embedded VLSI systems in form of heterogeneous single-chip architectures, comprising both hardware and software components, raises new demands on electronic CAD tools. Among the most challenging
Key concepts: Computer science, Digital signal processing, Heuristics, Code generation, Code (set theory), Parallel computing, Program optimization, Computer architecture