Results 251 to 260 of about 2,822,554 (294)

Rapid Computation of the Discrete Fourier Transform

SIAM Journal on Scientific Computing, 1996
This paper gives fast algorithms for the forward and inverse Fourier transform for an arbitrary number of nonequispaced points. Its computational procedure consists of a combination of the standard fast Fourier transform and approximation using local Taylor series expansions. The forward transform for nonequispaced points is computed as the solution of
Chris Anderson, Marie Dillon Dahleh
openaire   +2 more sources

The Discrete Fourier Transform and the Fast Fourier Transform

1998
The preceding chapters have made extensive mention of the Fourier transform (FT), the discrete Fourier transform (DFT), and the fast Fourier transform (FFT). This chapter examines the relationship between the FT and the DFT, discusses the FFT algorithm as a means of computing the DFT much more rapidly than can be achieved with the DFT algorithm ...
T. M. Peters, J. H. T. Bates
openaire   +1 more source

The Discrete Fourier Transform of a Recurrent Sequence

Applicable Algebra in Engineering, Communication and Computing, 1997
Let \(F_{q}\) be a finite field, and \((s_{i})_{i \geq 0}\) a maximal period linear recurring sequence in \(F_{q}\) with the primitive characteristic polynomial \[ f(x)=x^{n}-a_{n-1}x^{n-1}- \cdots -a_{0} \in F_{q}[x] \] Let \( \vartheta\) be the primitive element of \(F_{q^{n}}\) such that \[ f(x)= \prod_{i=0}^{n-1} (1- \vartheta^{q^{i}} x), \] \(g ...
openaire   +3 more sources

The Discrete Fourier Transform

2018
The DTFT of a discrete-time signal is a continuous function of the frequency (\( \omega \)), and hence, the relation between \( X\left( {\text{e}^{{j}\omega } } \right) \) and \( x(n) \) is not a computationally convenient representation. However, it is possible to develop an alternative frequency representation called the discrete Fourier transform ...
K. Deergha Rao, M. N. S. Swamy
openaire   +1 more source

Discrete-Time Fourier Transform Discrete Fourier Transform

2022
Muhammad N. Khan, Syed K. Hasnain, Mohsin Jamil   +2 more
openaire   +1 more source

Uniqueness of the discrete Fourier transform

Signal Processing, 2023
Isabelle Baraquin, Nicolas Ratier
openaire   +2 more sources

The Discrete Fourier Transform

1993
Abstract We will consider how several different networks handle many common algorithms. In order to do this, we follow Preparata and Vuillemin in [125] in defining a pair of generic parallel algorithms that can be easily implemented on the common network-Naturally, some networks are better than others for developing parallel ...
openaire   +1 more source

The discrete Fourier transform

1992
In Chapter 2 we developed properties of the (continuous-time) direct Fourier transform and the inverse Fourier transform, the two constituting an integral pair. Whereas Fourier series analysis is largely concerned with functions which are treated as being periodic, the Fourier transform provides an instrument for the analysis of non-periodic functions.
openaire   +1 more source

Discrete Fourier Transform

2002
The Fourier Transform has wide applications in scientific computing and engineering. Although it has a continuous version, we will consider only the discrete version (DFT) and present what is commonly known as the Fast Fourier Transform (FFT) algorithm.
openaire   +1 more source

Discrete Time Fourier Transform

2023
openaire   +1 more source