Results 1 to 10 of about 110,440 (116)
Ultrasound Assessment of Honey Using Fast Fourier Transform [PDF]
Sensors, 2021 Ultrasound inspection permits the characteristics of some foodstuffs to be determined easily and cheaply. This experimental study included the determination of various ultrasound parameters provided by the fast Fourier transform (FFT) which had not ...
Montaña Rufo +3 more
doaj +2 more sources
Computation of the normalized cross-correlation by fast Fourier transform. [PDF]
PLoS ONE, 2018 The normalized cross-correlation (NCC), usually its 2D version, is routinely encountered in template matching algorithms, such as in facial recognition, motion-tracking, registration in medical imaging, etc. Its rapid computation becomes critical in time
Artan Kaso
doaj +2 more sources
Nonlinearizad of Fast Fourier Transform
Цифровые модели и решения, 2023 A unified mathematical form of reversible nonlinear transformations based on a nonlinear tensor product is presented in the form of fast algorithms.
Valeriy Labunets +2 more
doaj +1 more source
Engineering Proceedings, 2023 For front-end wireless applications in small battery-powered devices, discrete Fourier transform (DFT) is a critical processing method for discrete time signals. Advanced radix structures are created to reduce the impact of transistor malfunction.
Ernest Ravindran Ramaswami Sachidanandan +2 more
doaj +1 more source
Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
Frontiers in Applied Mathematics and Statistics, 2023 The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various applications such as MRI
Melanie Kircheis, Daniel Potts
doaj +1 more source
Quartz-Tuning-Fork-Enhanced Spectroscopy Based on Fast Fourier Transform Algorithm
Frontiers in Physics, 2020 In this paper, a gas sensing technique based on quartz-crystal-tuning-fork-enhanced spectroscopy (QCTFES) and wavelength modulation spectroscopy (WMS) is reported.
Guangxiang Yang +3 more
doaj +1 more source
FourierPIM: High-throughput in-memory Fast Fourier Transform and polynomial multiplication
Memories - Materials, Devices, Circuits and Systems, 2023 The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity from the naive O(
Orian Leitersdorf +4 more
doaj +1 more source
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
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
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