Results 211 to 220 of about 51,064 (263)
Optical-computing technology offers new challenges to algorithm designers since it can perform an n-point discrete Fourier transform (DFT) computation in only unit time. Note that the DFT is a nontrivial computation in the parallel random-access machine model, a model of computing commonly used by parallel-algorithm designers. We develop two new models,
J H, Reif, A, Tyagi
openaire +3 more sources
DFT-CAM: Discrete Fourier Transform Driven Class Activation Map
Yang Yang Wang, Filiz Bunyak
openaire +2 more sources
The DFT: An Owner's Manual for the Discrete Fourier Transform
William L. Briggs, Van Emden Henson
openaire +2 more sources
The DFT: An Owner's Manual for the Discrete Fourier Transform
Robert Strawderman +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
High-resolution spectral analysis (HSA) vs. discrete fourier transform (DFT)
INTER-NOISE and NOISE-CON Congress and Conference Proceedings, 2021The Discrete Fourier Transform (DFT) is the standard technique for performing spectral analysis. It is used in the form of the well-known fast implementation (FFT) in almost all areas that deal with signal processing. However, the DFT algorithm has some limitations in terms of its resolution in time and frequency: the higher the time resolution, the ...
Roland Sottek, Thiago Lobato
openaire +1 more source
The ROCOF-DFT: A Discrete Fourier Transform Kernel Adaptation for ROCOF Tracking
Cesar Cazal +3 more
openaire +2 more sources

