Results 11 to 20 of about 129,078 (307)
Fast Fourier transform revisited
Lietuvos Matematikos Rinkinys, 2015 Using FFT (fast Fourier transform), it is assumed, that some signal samples in a respective period N are updated by a sensor in real time. It is urgent for every new signal sample to have new frequency samples (f.s.).
Rimantas Pupeikis
doaj +1 more source
A reverse of the Cauchy-Bunyakovsky-Schwarz integral inequality for complex-valued functions and applications for Fourier transform [PDF]
, 2004 A reverse of the Cauchy-Bunyakovsky-Schwarz integral inequality for complex-valued functions and applications for the finite Fourier transform are ...
Hanna, George T +5 more
core +1 more source
Empirical Evaluation of Typical Sparse Fast Fourier Transform Algorithms
IEEE Access, 2021 Computing the Sparse Fast Fourier Transform(sFFT) has emerged as a critical topic for a long time. The sFFT algorithms decrease the runtime and sampling complexity by taking advantage of the signal’s inherent characteristics that a large number of
Zhikang Jiang, Jie Chen, Bin Li
doaj +1 more source
Comparison of fast Fourier transform and convolution in wavelength scanning interferometry [PDF]
, 2011 The assessment of surface finish has become increasingly important in the field of precision engineering. Optical interferometry has been widely used for surface measurement due to the advantages of non-contact and high accuracy interrogation.
Gao, F. +7 more
core +1 more source
Harmonic detection of PV power generation system based on DFFT-WT-BP
Dianzi Jishu Yingyong, 2019 The existing FFT-WT algorithm and FFT-BP algorithm have advantages only for the detection of certain specific harmonics in photovoltaic systems. In this paper, the FFT-WT algorithm is improved, and a DFFT-WT algorithm is proposed. The FFT-BP algorithm is
Sun Cheng +5 more
doaj +1 more source
The Future Fast Fourier Transform? [PDF]
SIAM Journal on Scientific Computing, 1998 The authors propose that an inexact discrete Fourier transform such as an approximate matrix-vector approach based on singular values or a variation of the fast-multipole-based algorithm of \textit{A. Dutt} and \textit{V. Rokhlin} [Appl. Comput. Harmon. Anal. 2, No.
Alan Edelman +2 more
openaire +1 more source
Fast Partial Fourier Transform
CoRR, 2020 Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications. Despite its pervasive use, all known FFT algorithms do not provide a fine-tuning option for the user to specify ...
Yong-chan Park, Jun-Gi Jang, U Kang
openaire +2 more sources
Advances in Mechanical Engineering, 2019 The rolling element bearing is one of the most critical components in a machine. Vibration signals resulting from these bearings imply important bearing defect information related to the machinery faults.
Hsiung-Cheng Lin, Yu-Chen Ye
doaj +1 more source
Large-scale 3D fast Fourier transform computation on a GPU
ETRI Journal, 2023 We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory.
Jaehong Lee, Duksu Kim
doaj +1 more source
Sparse Fast Fourier Transform [PDF]
, 2022 Analisi di un recente algoritmo in C++ per calcolare la Trasformata di Fourier Sparsa (SFT) di un segnale. L'algoritmo sfrutta la sparsità di un segnale nel dominio delle frequenze per calcolare la Trasformata Discreta di Fourier (DFT) in tempi ...
Turi, Leo
core