Related papers: Short-time Fourier transform and superoscillations
Quantum analogues of the transient fluctuation theorem(TFT) and steady-state fluctuation theorem(SSFT) are investigated for a harmonic oscillator linearly coupled with a harmonic reservoir. The probability distribution for the work done…
This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary…
In order to enhance the performance of Transformer models for long-term multivariate forecasting while minimizing computational demands, this paper introduces the Joint Time-Frequency Domain Transformer (JTFT). JTFT combines time and…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
The Fast Fourier Transform (FFT) is the most efficiently known way to compute the Discrete Fourier Transform (DFT) of an arbitrary n-length signal, and has a computational complexity of O(n log n). If the DFT X of the signal x has only k…
Short-time Fourier transform (STFT) phase retrieval refers to the reconstruction of a function $f$ from its spectrogram, i.e., the magnitudes of its short-time Fourier transform $V_gf$ with window function $g$. While it is known that for…
Metaplectic Wigner distributions generalize the most popular time-frequency representations, such as the short-time Fourier transform (STFT) and $\tau$-Wigner distributions, using metaplectic operators. However, in order for a metaplectic…
To study the dynamical behaviour of the engineering and physical systems, we often need to capture their continuous behaviour, which is modeled using differential equations, and perform the frequency-domain analysis of these systems.…
Dispersive Fourier transform (TS-DFT) technique opens a fascinating pathway to explore the ultrafast non-repetitive even, which has been employed to study the build-up process of mode-locked lasers. Here the whole evolution dynamics (from…
Optical turbulence modelling and simulation are crucial for developing astronomical ground-based instruments, laser communication, laser metrology, or any application where light propagates through a turbulent medium. In the context of…
We study the regularity of smooth functions whose derivatives are dominated by sequences of the form $M_p^{\tau,\s}=p^{\tau p^{\s}}$, $\tau>0$, $\s\geq1$. We show that such functions can be characterized through the decay properties of…
The efficient multiangle centered discrete fractional Fourier transform (MA-CDFRFT) [1] has proven to be a useful tool for time-frequency analysis; in this paper, we generalize the MA-CDFRFT to general M -periodic transforms, which, among…
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…
This article presents a convenient approach to Fourier analysis for the investigation of functions and distributions defined in $\mathbb{T}^m \times \mathbb{R}^n$. Our approach involves the utilization of a mixed Fourier transform,…
Optoacoustic imaging technologies require fast and accurate signal pre-processing algorithms to enable widespread deployment in clinical and home-care settings. However, they still rely on the Discrete Fourier Transform (DFT) as the default…
In his monograph Chebyshev and Fourier Spectral Methods, John Boyd claimed that, regarding Fourier spectral methods for solving differential equations, ``[t]he virtues of the Fast Fourier Transform will continue to improve as the relentless…
We consider Random Matrix Theories with non-Gaussian potentials that have a rich phase structure in the large $N$ limit. We calculate the Spectral Form Factor (SFF) in such models and present them as interesting examples of dynamical models…
The graph fractional Fourier transform (GFRFT) for unitary graph Fourier transform (GFT) matrices can be interpreted through the scalar function $e^{j\alpha\theta}$ on the unit circle. Under the principal branch, its Fourier-series…