Results 1  10
of
17,341
SPIRAL: Code Generation for DSP Transforms
 PROCEEDINGS OF THE IEEE SPECIAL ISSUE ON PROGRAM GENERATION, OPTIMIZATION, AND ADAPTATION
"... Fast changing, increasingly complex, and diverse computing platforms pose central problems in scientific computing: How to achieve, with reasonable effort, portable optimal performance? We present SPIRAL that considers this problem for the performancecritical domain of linear digital signal proces ..."
Abstract

Cited by 222 (41 self)
 Add to MetaCart
processing (DSP) transforms. For a specified transform, SPIRAL automatically generates high performance code that is tuned to the given platform. SPIRAL formulates the tuning as an optimization problem, and exploits the domainspecific mathematical structure of transform algorithms to implement a feedback
Generation and Manipulation of DSP Transform Algorithms
, 2002
"... SPIRAL generates automatically high quality implementations for a variety of DSP signal transforms. The generated code is adapted to the machine configuration and architecture. SPIRAL achieves this through an intelligent search in the Cartesian product of the space of algorithms and the space of cod ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
SPIRAL generates automatically high quality implementations for a variety of DSP signal transforms. The generated code is adapted to the machine configuration and architecture. SPIRAL achieves this through an intelligent search in the Cartesian product of the space of algorithms and the space
Efcient Factorization of DSP Transforms using Taylor Expansion Diagrams
"... This paper describes an efcient method to perform factorization of DSP transforms based on Taylor Expansion Diagram (TED). It is shown that TED can efciently represent and manipulate mathematical expressions. We demonstrate that it enables efcient factorization of arithmetic expressions of DSP t ..."
Abstract
 Add to MetaCart
This paper describes an efcient method to perform factorization of DSP transforms based on Taylor Expansion Diagram (TED). It is shown that TED can efciently represent and manipulate mathematical expressions. We demonstrate that it enables efcient factorization of arithmetic expressions of DSP
Efficient Factorization of DSP Transforms using Taylor Expansion Diagrams
 in Design Automation and Test in Europe, DATE06
, 2006
"... This paper describes an efficient method to perform factorization of DSP transforms based on Taylor Expansion Diagram (TED). It is shown that TED can efficiently represent and manipulate mathematical expressions. We demonstrate that it enables efficient factorization of arithmetic expressions of DSP ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper describes an efficient method to perform factorization of DSP transforms based on Taylor Expansion Diagram (TED). It is shown that TED can efficiently represent and manipulate mathematical expressions. We demonstrate that it enables efficient factorization of arithmetic expressions
Formal Datapath Representation and Manipulation for Implementing DSP Transforms
"... We present a domainspecific approach to representing datapaths for hardware implementations of linear signal transform algorithms. We extend the tensor structure for describing linear transform algorithms, adding the ability to explicitly characterize two important dimensions of datapath architectu ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
We present a domainspecific approach to representing datapaths for hardware implementations of linear signal transform algorithms. We extend the tensor structure for describing linear transform algorithms, adding the ability to explicitly characterize two important dimensions of datapath
Performance/Energy Optimization of DSP Transforms on the XScale Processor ⋆
"... Abstract. The XScale processor family provides usercontrollable independent configuration of CPU, bus, and memory frequencies. This feature introduces another handle for the code optimization with respect to energy consumption or runtime performance. We quantify the effect of frequency configuratio ..."
Abstract
 Add to MetaCart
configurations on both performance and energy for three signal processing transforms: the discrete Fourier transform (DFT), finite impulse response (FIR) filters, and the WalshHadamard Transform (WHT). To do this, we use SPIRAL, a program generation and optimization system for signal processing transforms
Automatic generation of implementations for DSP transforms on fused multiplyadd architectures
 in Proc. IEEE Int’l Conf. Acoustics, Speech, and Signal Processing (ICASSP
, 2004
"... Many modern computer architectures feature fused multiplyadd (FMA) instructions, which offer potentially faster performance for numerical applications. For DSP transforms, compilers can only generate FMA code to a very limited extent because optimal use of FMAs requires modifying the chosen algorit ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Many modern computer architectures feature fused multiplyadd (FMA) instructions, which offer potentially faster performance for numerical applications. For DSP transforms, compilers can only generate FMA code to a very limited extent because optimal use of FMAs requires modifying the chosen
AUTOMATIC GENERATION OF IMPLEMENTATIONS FOR DSP TRANSFORMS ON FUSED MULTIPLYADD ARCHITECTURES
"... Many modern computer architectures feature fused multiplyadd (FMA) instructions, which offer potentially faster performance for numerical applications. For DSP transforms, compilers can only generate FMA code to a very limited extent because optimal use of FMAs requires modifying the chosen algorit ..."
Abstract
 Add to MetaCart
Many modern computer architectures feature fused multiplyadd (FMA) instructions, which offer potentially faster performance for numerical applications. For DSP transforms, compilers can only generate FMA code to a very limited extent because optimal use of FMAs requires modifying the chosen
A Mathematical Approach for Compiling and Optimizing Hardware Implementations of DSP Transforms
, 2010
"... Linear signal transforms (such as the discrete Fourier transform) are frequently used in digital signal processing and related fields. Algorithms for computing linear transforms are wellunderstood and typically have a high degree of regularity and parallelism, making them wellsuited for implementa ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Linear signal transforms (such as the discrete Fourier transform) are frequently used in digital signal processing and related fields. Algorithms for computing linear transforms are wellunderstood and typically have a high degree of regularity and parallelism, making them well
A Mathematical Approach for Compiling and Optimizing Hardware Implementations of DSP Transforms
"... Linear signal transforms (such as the discrete Fourier transform) are frequently used in digital signal processing and related fields. Algorithms for computing linear transforms are wellunderstood and typically have a high degree of regularity and parallelism, making them wellsuited for implementa ..."
Abstract
 Add to MetaCart
Linear signal transforms (such as the discrete Fourier transform) are frequently used in digital signal processing and related fields. Algorithms for computing linear transforms are wellunderstood and typically have a high degree of regularity and parallelism, making them well
Results 1  10
of
17,341