Results 211 to 220 of about 36,170 (260)

Fractional discrete Fourier transforms

Optics Letters, 1996
Direct calculation of fractional Fourier transforms from the expressions derived for their optical implementation is laborious. An extension of the discrete Fourier transform would have only O(N(2)) computational complexity. We define such a system, offer a general way to compute the fractional discrete Fourier transform matrix, and numerically ...
Z T, Deng, H J, Caulfield, M, Schamschula   +2 more
openaire   +2 more sources

Discrete Fourier Transform Tensors and Their Ranks

SIAM Journal on Matrix Analysis and Applications, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steven P. Diaz, Adam Lutoborski
openaire   +2 more sources

Exact discretization by Fourier transforms

Communications in Nonlinear Science and Numerical Simulation, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The odd discrete Fourier transform

ICASSP '76. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
It is shown that the Discrete Fourier Transform (DFT), when used in the conventional manner with the frequency samples located at zero and integer multiples of 1/T, where T is the signal duration, gives an inaccurate representation of the spectrum of certain frequencies that are located near the top and bottom end of the band.
openaire   +1 more source

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   +1 more source

Real discrete Fourier transform

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
The real discrete Fourier transform (RDFT) corresponds to the Fourier series for sampled periodic signals with sampled periodic frequency responses just as discrete Fourier transform (DFT) corresponds to the complex Fourier series for the same type of signals. RDFT has better performance than DFT in data compression and filtering for all signals in the
openaire   +1 more source

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   +2 more sources

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   +1 more source