Results 11 to 20 of about 257,484 (138)
New fast algorithm for two-dimensional discrete Fourier transform DFT(2 n ; 2)
Electronics Letters, 1989 We present a new fast algorithm for computing the two-dimensional discrete Fourier transform DFT(2n; 2) using the fast discrete cosine transform algorithm. The algorithm has a lower number of multiplications and additions compared with other published algorithms for computing the two-dimensional DFT.
Dekun Yang, Weizhen Ma
openaire +3 more sources
, 2009 Publication in the conference proceedings of EUSIPCO, Glasgow, Scotland ...
SERBES, Ahmet, Durak, Lütfiye
openaire +4 more sources
Discrete two dimensional Fourier transform in polar coordinates part II: numerical computation and approximation of the continuous transform [PDF]
PeerJ Computer Science, 2020 The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date.
Xueyang Yao, Natalie Baddour
doaj +2 more sources
Interpolated DFT Algorithm for Frequency Estimation by Using Maximum Sidelobe Decay Windows
IEEE Access, 2022 A sinusoidal frequency estimator based on interpolated Discrete Fourier Transform (DFT) algorithm by using Maximum Sidelobe Decay (MSD) windows is proposed in this paper. Firstly, the received sinusoid is weighted by an appropriate MSD window.
Huihao Wu +5 more
doaj +1 more source
DFT-CAM: Discrete Fourier Transform Driven Class Activation Map
2023 IEEE International Conference on Image Processing (ICIP), 2023 Yang Yang Wang, Filiz Bunyak
openaire +2 more sources
Simplification of DFT and IDFT in PRACH
Electronics Letters, 2023 The respective simplifications of prime‐point discrete Fourier transform (DFT) and ultra‐long‐point inverse discrete Fourier transform (IDFT) in physical random access channel (PRACH) are proposed. The former is an equivalent substitution of DFT function
Yufeng Jiang, Shouxin Kang
doaj +1 more source
Discrete Fourier transform and permutations [PDF]
Bulletin of the Polish Academy of Sciences: Technical Sciences, 2019 It is well known that the magnitudes of the coefficients of the discrete Fourier transform (DFT) are invariant under certain operations on the input data. In this paper, the effects of rearranging the elements of an input data on its DFT are studied.
S. Hui, S.H. Żak
doaj +1 more source
DFT-Based Frequency Estimation of Multiple Sinusoids
IEEE Access, 2022 An accurate frequency estimation method of multi-component sinusoidal signal in additive white Gaussian noise (AWGN) is proposed. The algorithm is implemented in the frequency domain and based on discrete Fourier transform (DFT). The maximum DFT spectral
Nian Liu +5 more
doaj +1 more source
New Algorithm for Real-Valued Fourier Transform
Tikrit Journal of Engineering Sciences, 2023 This paper presents a direct algorithm for fast real discrete Fourier transform (RDFT) computing, using the discrete Fourier transform (DFT) conjugate symmetric property to reduce redundancies.
Sukaina K. Salih, Mounir T. Hamood
doaj +1 more source
Comparison of discrete transforms for deep‐neural‐networks‐based speech enhancement
IET Signal Processing, 2022 In recent studies of speech enhancement, a deep‐learning model is trained to predict clean speech spectra from the known noisy spectra of speech. Rather than using the traditional discrete Fourier transform (DFT), this paper considers other well‐known ...
Wissam A. Jassim, Naomi Harte
doaj +1 more source