Related papers: Short-time Fourier transform and superoscillations
Oscillatory processes are central for the understanding of the neural bases of cognition and behaviour. To analyse these processes, time-frequency (TF) decomposition methods are applied and non-parametric cluster-based statistical procedure…
The Zak-transform-based Orthogonal Time Frequency Space (Zak-OTFS), offers a robust framework for high-mobility communications by simplifying the input-output (I/O) relation to a twisted convolution. While this structure theoretically…
In many mechanical, electrical, and general physical systems evolving over time or space, spectral analysis methods as Fast Fourier Transform (FFT), Short Term Fourier Transform (STFT), Power Spectrum Density (PSD) plays a very important…
The finite STFT Synchrosqueezing transform is a time-frequency analysis method that can decompose finite complex signals into time-varying oscillatory components. This representation is sparse and invertible, allowing recovery of the…
We present a new algorithm for the 2D Sliding Window Discrete Fourier Transform (SWDFT). Our algorithm avoids repeating calculations in overlapping windows by storing them in a tree data-structure based on the ideas of the Cooley- Tukey…
This letter extends the concept of graph-frequency to graph signals that evolve with time. Our goal is to generalize and, in fact, unify the familiar concepts from time- and graph-frequency analysis. To this end, we study a joint temporal…
We present a new primitive for quantum algorithms that implements a discrete Hermite transform efficiently, in time that depends logarithmically in both the dimension and the inverse of the allowable error. This transform, which maps basis…
The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…
We use time-frequency methods for the study of Fourier Integral operators (FIOs). In this paper we shall show that Gabor frames provide very efficient representations for a large class of FIOs. Indeed, similarly to the case of shearlets and…
We consider the classical 1D phase retrieval problem. In order to overcome the difficulties associated with phase retrieval from measurements of the Fourier magnitude, we treat recovery from the magnitude of the short-time Fourier transform…
The quantum Fourier transform (QFT) is a fundamental primitive in quantum computation and quantum information. In this work, we generalize the QFT for finite groups to a QFT for finite-dimensional semisimple algebras, and give efficient…
We revisit the classical problem of Fourier-sparse signal reconstruction -- a variant of the \emph{Set Query} problem -- which asks to efficiently reconstruct (a subset of) a $d$-dimensional Fourier-sparse signal ($\|\hat{x}(t)\|_0 \leq…
Fourier transform-based methods enable accurate, dispersion-free simulations of time-domain scattering problems by evaluating solutions to the Helmholtz equation at a discrete set of frequencies sufficient to approximate the inverse Fourier…
The problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received…
A target recognition framework relying on near-field integrated sensing and communication (ISAC) systems is proposed. By exploiting the distance-dependent spatial signatures provided by the near-field spherical wavefront, high-accuracy…
In this paper, we study the convolution structure in the special affine Fourier transform domain to combine the advantages of the well known special affine Fourier and Stockwell transforms into a novel integral transform coined as special…
We consider the numerical integration of the Gross-Pitaevskii equation with a potential trap given by a time-dependent harmonic potential or a small perturbation thereof. Splitting methods are frequently used with Fourier techniques since…
Superoscillations, i.e., the phenomenon that a bandlimited function can temporary oscillate faster than its highest Fourier component, are being much discussed for their potential for `superresolution' beyond the diffraction limit. Here, we…
The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two…
Recent progress in graph signal processing (GSP) has addressed a number of problems, including sampling and filtering. Proposed methods have focused on generic graphs and defined signals with certain characteristics, e.g., bandlimited…