Results 11 to 20 of about 468,310 (277)
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
Fast inverse nonlinear Fourier transform [PDF]
Physical Review E, 2018 This paper considers the non-Hermitian Zakharov-Shabat (ZS) scattering problem which forms the basis for defining the SU$(2)$-nonlinear Fourier transform (NFT). The theoretical underpinnings of this generalization of the conventional Fourier transform is quite well established in the Ablowitz-Kaup-Newell-Segur (AKNS) formalism; however, efficient ...
openaire +5 more sources
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
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
Exact quantum Fourier transforms and discrete logarithm algorithms [PDF]
, 2003 We show how the quantum fast Fourier transform (QFFT) can be made exact for arbitrary orders (first for large primes). For most quantum algorithms only the quantum Fourier transform of order $2^n$ is needed, and this can be done exactly.
Mosca, Michele, Zalka, Christof
core +4 more sources
Arbitrary Sampling Fourier Transform and Its Applications in Magnetic Field Forward Modeling
Applied Sciences, 2022 Numerical simulation and inversion imaging are essential in geophysics exploration. Fourier transform plays a vital role in geophysical numerical simulation and inversion imaging, especially in solving partial differential equations.
Shikun Dai +4 more
doaj +1 more source
Fast Fourier Transform power spectrum of radon activity
Radiation Protection and Environment, 2018 Measurement of outdoor Radon-222 (222Rn) activity at National Atmospheric Research Laboratory (NARL), Gadanki, India, is carried out using Alpha GUARD PQ 2000 PRO from October 2011 to July 2014 and analyzed.
K Charan Kumar +3 more
doaj +1 more source