Results 21 to 30 of about 51,064 (263)
Eigenvectors of the Discrete Fourier Transform Based on the Bilinear Transform
EURASIP Journal on Advances in Signal Processing, 2010 Determining orthonormal eigenvectors of the DFT matrix, which is closer to the samples of Hermite-Gaussian functions, is crucial in the definition of the discrete fractional Fourier transform.
Ahmet Serbes, Lutfiye Durak-Ata
doaj +2 more sources
A New Pseudo-Spectral Method Using the Discrete Cosine Transform
Journal of Imaging, 2020 The pseudo-spectral (PS) method on the basis of the Fourier transform is a numerical method for estimating derivatives. Generally, the discrete Fourier transform (DFT) is used when implementing the PS method. However, when the values on both sides of the
Izumi Ito
doaj +1 more source
An approach to power system harmonic analysis based on triple-line interpolation discrete Fourier transform [PDF]
Archives of Electrical Engineering, 2022 The discrete Fourier transform (DFT) is a principal method for power system harmonic analysis. The fundamental frequency of the power system increases or decreases following load changes during normal operation.
Ling Liu, Jinsong Zhang
doaj +1 more source
Discrete Two-Dimensional Fourier Transform in Polar Coordinates Part I: Theory and Operational Rules
Mathematics, 2019 The theory of the continuous two-dimensional (2D) Fourier transform in polar coordinates has been recently developed but no discrete counterpart exists to date.
Natalie Baddour
doaj +1 more source
Comparison of Image Compressions: Analog Transformations
Proceedings, 2020 A comparison between the four most used transforms, the discrete Fourier transform (DFT), discrete cosine transform (DCT), the Walsh–Hadamard transform (WHT) and the Haar-wavelet transform (DWT), for the transmission of analog images, varying their ...
Jose Balsa
doaj +1 more source
On the Performance of Turbo Signal Recovery with Partial DFT Sensing Matrices [PDF]
, 2015 This letter is on the performance of the turbo signal recovery (TSR) algorithm for partial discrete Fourier transform (DFT) matrices based compressed sensing.
Ma, Junjie, Ping, Li, Yuan, Xiaojun
core +1 more source
Joint Channel Estimation Algorithm Based on DFT and DWT
Applied Sciences, 2022 Channel estimation is an important component of orthogonal frequency division multiplexing (OFDM) systems. The existence of virtual subcarriers leads to energy spreading in the time-domain when using Inverse Fast Fourier Transform (IFFT), resulting in ...
Zhe Zhang, Xin Bian, Mingqi Li
doaj +1 more source
Extended Smoothing Methods for Sparse Test Data Based on Zero-Padding
Applied Sciences, 2023 Aiming at the problem of sparse measurement points due to test conditions in engineering, a smoothing method based on zero-padding in the wavenumber domain is proposed to increase data density.
Pan Zhou +5 more
doaj +1 more source
Recovering missing slices of the discrete fourier transform using ghosts [PDF]
, 2012 The discrete Fourier transform (DFT) underpins the solution to many inverse problems commonly possessing missing or unmeasured frequency information. This incomplete coverage of the Fourier space always produces systematic artifacts called Ghosts.
Chandra, Shekhar S. +4 more
core +1 more source
Two-band fast Hartley transform [PDF]
, 2015 This article has been made available through the Brunel Open Access Publishing Fund.Efficient algorithms have been developed over the past 30 years for computing the forward and inverse discrete Hartley transforms (DHTs).
A.K. Nandi +10 more
core +2 more sources