Results 201 to 210 of about 36,170 (260)

A hybrid AI framework for identification of power quality disturbances in electrical network. [PDF]

Sci Rep
Debnath R, Majumder A, Jain AK, Dey B.
europepmc   +1 more source

Fast Fourier Transform Enables Automated Parametrization of Complex Dihedral Potentials in All-Atom and Coarse-Grained Force Fields. [PDF]

J Chem Inf Model
Flores-Trujillo HT, Rodríguez-Segura GL, Amador-Bedolla C, Dominguez L.   +3 more
europepmc   +1 more source

Fault diagnosis method of rolling-element bearings via FBEWT and EIRVM. [PDF]

Sci Rep
Zheng Q, Li Y, Chen Y, Chen X, Xu K, Yin Z.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The Fourier transform and the discrete Fourier transform

Inverse Problems, 1989
This paper gives an error bound in computing the Fourier transform for a square summable function by means of the discrete Fourier transform. In detail description, the error bound depends on the number of samples, the interval where the samples are taken, the interval where the Fourier transform is being approximated, the local averaging in the time ...
Auslander, Louis, Grünbaum, F. Alberto
openaire   +2 more sources

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

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

On commutativity of Discrete Fourier Transform

Information Processing Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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