Sciweavers

187 search results - page 3 / 38
» Alternatives to the discrete fourier transform
Sort
View
IAJIT
2010
107views more  IAJIT 2010»
13 years 3 months ago
Low Latency, High Throughput, and Less Complex VLSI Architecture for 2D-DFT
: This paper proposes a pipelined, systolic architecture for two- dimensional discrete Fourier transform computation which is highly concurrent. The architecture consists of two, o...
Sohil Shah, Preethi Venkatesan, Deepa Sundar, Muni...
ISCAS
1999
IEEE
82views Hardware» more  ISCAS 1999»
13 years 9 months ago
Discrete fractional Hadamard transform
This paper is concerned with the definitions of the discrete fractional cosine transform (DFRCT) and the discrete fractional sine transform (DFRST). The definitions of DFRCT and DF...
Soo-Chang Pei, Min-Hung Yeh
ICASSP
2011
IEEE
12 years 9 months ago
The Centered Discrete Fourier Transform and a parallel implementation of the FFT
This paper describes a novel method for the computation of the Discrete Fourier Transform (DFT). The development of a truly centered DFT is coupled with a method for computing the...
Dale H. Mugler
CIS
2008
Springer
13 years 7 months ago
Discrete Fourier Transform Computation Using Neural Networks
In this paper, a method is introduced how to process the Discrete Fourier Transform (DFT) by a singlelayer neural network with a linear transfer function. By implementing the sugg...
Rosemarie Velik
IPPS
2003
IEEE
13 years 10 months ago
Short Vector Code Generation for the Discrete Fourier Transform
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Coo...
Franz Franchetti, Markus Püschel