This paper presents a new approach to solving the DSP address code generation problem. A minimum cost circulation approach is used to efficiently generate high-performance addressing code in polynomial time. Results show that addressing code size improvements of up to 6x are obtained, accounting for up to 1.6x improvement in code size and performance of compiler-generated DSP code. This research is important for industry since this value-added technique can improve code size, energy dissipation, and performance, without increasing cost
Execution of a program almost always involves multiple address spaces, possibly across separate mach...
[[abstract]]We propose a microcode-optimizing method targeting a programmable DSP processor. Efficie...
International audienceIn digital signal processors (DSPs), variables are accessed using k address re...
This paper presents a new approach to solving the DSP address assignment problem. A minimum cost cir...
This paper presents DSP code optimization techniques, which originate from dedicated memory address ...
This paper presents a model for simultaneous instruction selection, compaction, and register allocat...
Since most DSP applications access large amount of data stored in the memory, a DSP code generator m...
The dramatic reduction in the cost of electronic devices combined with large improvements in design ...
Abstract—Many application-specific architectures provide indirect addressing modes with auto-increme...
One important part of generating code for DSP processors is to make good use of the address generati...
Many embedded architectures provide indirect addressing modes with autoincrement /decrement arithmet...
DSP architectures typically provide dedicated memory address generation units and indirect addressin...
Recent work on compilation for DSP-processors deals with optimizing access to local variables of fun...
An increasing number of components in embedded systems are implemented by software running on embe...
We investigate the problem of code generation for DSP systems on a chip. Such systems devote a limit...
Execution of a program almost always involves multiple address spaces, possibly across separate mach...
[[abstract]]We propose a microcode-optimizing method targeting a programmable DSP processor. Efficie...
International audienceIn digital signal processors (DSPs), variables are accessed using k address re...
This paper presents a new approach to solving the DSP address assignment problem. A minimum cost cir...
This paper presents DSP code optimization techniques, which originate from dedicated memory address ...
This paper presents a model for simultaneous instruction selection, compaction, and register allocat...
Since most DSP applications access large amount of data stored in the memory, a DSP code generator m...
The dramatic reduction in the cost of electronic devices combined with large improvements in design ...
Abstract—Many application-specific architectures provide indirect addressing modes with auto-increme...
One important part of generating code for DSP processors is to make good use of the address generati...
Many embedded architectures provide indirect addressing modes with autoincrement /decrement arithmet...
DSP architectures typically provide dedicated memory address generation units and indirect addressin...
Recent work on compilation for DSP-processors deals with optimizing access to local variables of fun...
An increasing number of components in embedded systems are implemented by software running on embe...
We investigate the problem of code generation for DSP systems on a chip. Such systems devote a limit...
Execution of a program almost always involves multiple address spaces, possibly across separate mach...
[[abstract]]We propose a microcode-optimizing method targeting a programmable DSP processor. Efficie...
International audienceIn digital signal processors (DSPs), variables are accessed using k address re...