METHOD OF OBTAINING THE SPECTRAL CHARACTERISTICS OF THE SCANNING PROBE MICROSCOPE
Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska, 2021 The article discusses methods and algorithms for digital processing and filtering when carrying out nano-measurements using a scanning probe microscope.
Mariia Kataieva, Vladimir Kvasnikov
doaj +1 more source
Explicit Hermite-type eigenvectors of the discrete Fourier transform [PDF]
, 2015 The search for a canonical set of eigenvectors of the discrete Fourier transform has been ongoing for more than three decades. The goal is to find an orthogonal basis of eigenvectors which would approximate Hermite functions -- the eigenfunctions of the ...
Kuznetsov, Alexey
core +1 more source
Implementation of Discrete Fourier Transform And Orthogonal Discrete Wavelet Transform In Python
JISR on Computing, 2016 This paper presents implementation of Discrete Fourier Transform and Orthogonal Discrete Wavelet Transform in Python computer programming language. The Fourier Transform is a fundamental signal processing tool whereas the Wavelet Transform is a powerful
Tariq Javid Ali +4 more
doaj +1 more source
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
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
Logarithm of the Discrete Fourier Transform
International Journal of Mathematics and Mathematical Sciences, 2007 The discrete Fourier transform defines a unitary matrix operator. The logarithm of this operator is computed, along with the projection maps onto its eigenspaces. A geometric interpretation of the discrete Fourier transform is also given.
Michael Aristidou, Jason Hanson
doaj +1 more source
Quantum Fourier transform revisited [PDF]
, 2020 The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering.
Bullock SS +5 more
core +2 more sources
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.
Serbes Ahmet, Durak-Ata Lutfiye
doaj +2 more sources
Coherent Dynamics of Quantum Systems with Non-Uniform Fourier Space Excited by Laser Radiation
Zanco Journal of Pure and Applied Sciences, 2022 The algorithm is presented to solve dynamical equations for excitation of molecular models with multiple energy levels. It uses only discrete structures: discrete orthogonal polynomials constructed specially in Fourier space of the probability amplitudes,
Sary Banjak , Vadim Savva
doaj +1 more source
The Discrete Fourier Transform Over the Binary Finite Field
IEEE Access, 2023 The novel methods for binary discrete Fourier transform (DFT) computation over the finite field have been proposed. The methods are based on a binary trace calculation over the finite field and use the cyclotomic DFT.
Sergei Valentinovich Fedorenko
doaj +1 more source