Abstract: Generating optimum data memory layouts and address pointer assignments for digital signal processors are hard combinatorial optimization problems.
Generating optimum data memory layouts and address pointer assignments for digital signal processors are hard combinatorial optimization problems.
Digital signal processors provide dedicated address generation units that support zero-cost address pointer modifications within a limited offset range.
People also ask
Which type of programming is typically used for digital signal processors?
We propose a two-step address assignment technique for scalar variables using a genetic algorithm based partitioning method and a graph based heuristic which ...
Missing: Optimum | Show results with:Optimum
In this paper, we present an integrated data memory layout and address register assignment optimization pro- cedure. This technique allows to reduce both ...
Abstract{ This paper presents DSP code optimization techniques, which originate from dedicated memory ad- dress generation hardware.
Optimizing the code size of a digital signal processing application is a crucial step in generating high quality and efficient code for embedded systems.
Offset assignment has been studied as a highly effective approach to code optimization in modern digital signal processors (DSPs). In this paper, we propose ...
This work introduces a new algorithm that iterates over several optimized layout generation and optimum pointer assignments steps and shows that for a fixed ...
In this paper we propose a procedure to generate code with minimum number of addressing instructions. We analyze different methods of generating addressing ...
Missing: pointer | Show results with:pointer