A number of DSP algorithms involve linear transforms employing weighted sum computations, where the weights are fixed at design time. Add-shift implementation of such a computation results in a data flow graph that has multiple precision variables and functional units. We explore the potential of precision sensitive approach for the high level synthesis of such multi-precision DFGs. We focus on fixed latency implementation of these DFGs. We present register allocation, functional unit binding and scheduling algorithms to exploit the multi-precision nature of such DFGs for area efficient implementation. The proposed approach is fairly generic and could be applied to multi-precision DFGs involving any type of functional units. Significant imp...
Various aspects of the two major tasks in high-level synthesis, scheduling and allocation, are studi...
Digital signal processing algorithms are described by iterative data-flow graphs where nodes represe...
This paper presents an heuristic method to solve the combined resource selection and binding problem...
A fuzzy logic approach for module selection and process allocation of fully static DSP data flow gra...
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast H...
In this paper, we propose a design methodology for implementing a multimode (or multi-configuration)...
Most scientific and DSP applications are recursive or iterative. Uniform nested loops can be modeled...
Complexities of applications implemented on embedded and programmable systems grow with the advances...
Complexities of applications implemented on embedded and programmable systems grow with the advances...
Finite-precision computing is an important topic, which has vast applications from computer arithmet...
In high level synthesis a data-flow graph (DFG) description of an algorithm is mapped onto a registe...
Time-critical sections of multi-dimensional problems, such as image processing applications, are in ...
Multirate digital signal processing (DSP) algorithms are often modeled with synchronous dataflow gra...
12 pagesInternational audienceThis paper describes a systematic method and an experimental software ...
Various aspects of the two major tasks in high-level synthesis, scheduling and allocation, are studi...
Digital signal processing algorithms are described by iterative data-flow graphs where nodes represe...
This paper presents an heuristic method to solve the combined resource selection and binding problem...
A fuzzy logic approach for module selection and process allocation of fully static DSP data flow gra...
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast H...
In this paper, we propose a design methodology for implementing a multimode (or multi-configuration)...
Most scientific and DSP applications are recursive or iterative. Uniform nested loops can be modeled...
Complexities of applications implemented on embedded and programmable systems grow with the advances...
Complexities of applications implemented on embedded and programmable systems grow with the advances...
Finite-precision computing is an important topic, which has vast applications from computer arithmet...
In high level synthesis a data-flow graph (DFG) description of an algorithm is mapped onto a registe...
Time-critical sections of multi-dimensional problems, such as image processing applications, are in ...
Multirate digital signal processing (DSP) algorithms are often modeled with synchronous dataflow gra...
12 pagesInternational audienceThis paper describes a systematic method and an experimental software ...
Various aspects of the two major tasks in high-level synthesis, scheduling and allocation, are studi...
Digital signal processing algorithms are described by iterative data-flow graphs where nodes represe...
This paper presents an heuristic method to solve the combined resource selection and binding problem...