Results 11 to 20 of about 584,919 (306)
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
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
Quantum circuit for the fast Fourier transform [PDF]
Quantum Information Processing, 2019 We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector spaces.
Ryo Asaka, K. Sakai, Ryoko Yahagi
semanticscholar +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
A Nonuniform Fast Fourier Transform Based on Low Rank Approximation [PDF]
SIAM Journal on Scientific Computing, 2017 By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast and quasi-optimal algorithm for computing the NUDFT based on the fast Fourier transform (FFT).
D. Ruiz-Antolín, Alex Townsend
semanticscholar +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
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
A review on sparse fast fourier transform applications in image processing
, 2020 Fast Fourier Transform has long been established as an essential tool in signal processing. To address the computational issues while helping the analysis work for multi-dimensional signals in image processing, sparse Fast Fourier Transform model is ...
Hadhrami Ab. Ghani +4 more
semanticscholar +1 more source
OCTAD-S: digital fast Fourier transform spectrometers by FPGA
Earth, Planets and Space, 2017 We have developed a digital fast Fourier transform spectrometer made of an analog-to-digital converter (ADC) and a field-programmable gate array (FPGA).
Kazumasa Iwai +7 more
doaj +1 more source