Results 241 to 250 of about 2,822,554 (294)

Generalized discrete Fourier transforms: the discrete Fourier-Riccati-Bessel transform

Computer Physics Communications, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stade, Eric, Layton, E. G.
openaire   +1 more source

The discrete rotational Fourier transform

IEEE Transactions on Signal Processing, 1996
We define a discrete version of the angular Fourier transform and present the properties of the transform that show it to be a rotation in time-frequency space, this new transform is a generalization of the DFT. Efficient algorithms for its computation can then be based on the FFT and the eigenstructure of the DFT.
Balu Santhanam, James H. McClellan
openaire   +2 more sources

On commutativity of Discrete Fourier Transform

Information Processing Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

The quick discrete Fourier transform

Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing, 2002
This paper will look at an approach that uses symmetric properties of the basis function to remove redundancies in the calculation of discrete Fourier transform (DFT). We will develop an algorithm, called the quick Fourier transform (QFT), that will reduce the number of floating point operations necessary to compute the DFT by a factor of two or four ...
Haitao Guo, Gary A. Sitton, C. Sidney Burrus   +2 more
openaire   +2 more sources

Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform

SIAM Journal on Scientific Computing, 1996
Accuracy of the discrete Fourier transform (DFT) and the fast Fourier transform (FFT) depends on the accuracy of the twiddle factors entirely. For accurate twiddle factor tables, this paper recommends to compute the sine/cosine functions with high precision arithmetic along the algorithms in terms of faster converging approximations, such as rational ...
openaire   +1 more source

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

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

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