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 +4 more sources
Steerable Discrete Fourier Transform [PDF]
IEEE Signal Processing Letters, 2017 Directional transforms have recently raised a lot of interest thanks to their numerous applications in signal compression and analysis. In this letter, we introduce a generalization of the discrete Fourier transform (DFT), called steerable DFT (SDFT ...
Giulia Fracastoro, Enrico Magli
exaly +4 more sources
The Discrete Fourier Transform (DFT) in Behavioural Analysis
Journal of Theoretical Biology, 1994 Abstract Spectral analysis is an important tool for examining time-series data and can be particularly powerful in detecting periodicity in animal behaviour patterns. Because of its simplicity and the speed of current computing algorithms, the discrete Fourier transform is most often used in spectral analysis.
T.G. Forrest, Robert B. Suter
openaire +2 more sources
STEGANOGRAFI MENGGUNAKAN METODE DISCRETE FOURIER TRANSFORM (DFT)
Jurnal Informatika Polinema, 2018 Seiring dengan kemajuan teknologi, serangan terjadi pada industri photography di mana banyak penyalahgunaan foto yang memiliki hak cipta tanpa seijin pemilik foto tersebut. Karena itulah dibuat sebuah aplikasi yang berfungsi untuk menyisipkan watermark dengan menggunakan metode DFT (Discrete Fourier Transform).
null Yuri Ariyanto +2 more
openaire +3 more sources
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 +3 more sources
Error Estimates on Approximating the Finite Fourier Transform of Complex-Valued Functions via a Pre-Grüss Inequality [PDF]
, 2004 Some estimates for the error in approximating the Finite Fourier Transform in terms of exponential means via a pre-Grüss inequality for complex-valued functions are ...
Hanna, George T +2 more
core +6 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
High-dimensional discrete Fourier transform gates with a quantum frequency processor. [PDF]
Optics Express, 2022 The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms such as ...
Hsuan-Hao Lu +4 more
semanticscholar +1 more source
Radar matched filtering using the fractional fourier transform [PDF]
, 2010 -A matched filter is the optimal linear filter for maximizing the signal to noise ratio (SNR) in the presence of additive noise. Matched filters are commonly used in radar systems where the transmitted signal is known and may be used as a replica to be ...
Clemente, Carmine +2 more
core +4 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