Related papers: Time-frequency analysis on flat tori and Gabor fra…
Quantum Fourier transform (QFT) is a key ingredient of many quantum algorithms where a considerable amount of ancilla qubits and gates are often needed to form a Hilbert space large enough for high-precision results. Qubit recycling reduces…
We explore the superstring theory on AdS_3 x S^3 x T^4 in the framework given in hep-th/9806194. We argue on the Hilbert space of "space-time CFT", and especially construct a suitable vacuum of this CFT from the physical degrees of freedom…
Given a time series vector, how can we efficiently compute a specified part of Fourier coefficients? Fast Fourier transform (FFT) is a widely used algorithm that computes the discrete Fourier transform in many machine learning applications.…
The concept of Hilbert space fragmentation (HSF) has recently been put forward as a routine to break quantum ergodicity. Although HSF exists widely in models with dynamical constraints, it is still challenging to tune it. Here, we propose a…
The problem of recovering a signal from its Fourier magnitude is of paramount importance in various fields of engineering and applied physics. Due to the absence of Fourier phase information, some form of additional information is required…
In the past decade, several multi-resolution representation theories for graph signals have been proposed. Bipartite filter-banks stand out as the most natural extension of time domain filter-banks, in part because perfect reconstruction,…
The Fast Fourier Transform (FFT) is one of the most widely used algorithms in high performance computing, with critical applications in spectral analysis for both signal processing and the numerical solution of partial differential…
Many phenomena are described by bivariate signals or bidimensional vectors in applications ranging from radar to EEG, optics and oceanography. The time-frequency analysis of bivariate signals is usually carried out by analyzing two separate…
We study nonuniform sampling in shift-invariant spaces and the construction of Gabor frames with respect to the class of totally positive functions whose Fourier transform factors as $ \hat g(\xi)= \prod_{j=1}^n (1+2\pi i\delta_j\xi)^{-1}…
Exploring the concept of the extended Galilei group G. Representations for field theories in a symplectic manifold have been derived in association with the method of the Wigner function. The representation is written in the light-cone of a…
In this work, we present the \emph{twiddless fast Fourier transform (TFFT)}, a novel algorithm for computing the $N$-point discrete Fourier transform (DFT). The TFFT's divide strategy builds on recent results that decimate an $N$-point…
Let $(g_{nm})_{n,m\in Z}$ be a Gabor frame for $L_2(R)$ for given window $g$. We show that the window $h^0=S^{-1/2} g$ that generates the canonically associated tight Gabor frame minimizes $\|g-h\|$ among all windows $h$ generating a…
The synchrosqueezing transform (SST) has been developed as a powerful EMD-like tool for instantaneous frequency (IF) estimation and component separation of non-stationary multicomponent signals. Recently, a direct method of the…
A symplectic pseudospectral time-domain (SPSTD) scheme is developed to solve Schrodinger equation. Instead of spatial finite differences in conventional finite-difference time-domain (FDTD) method, the fast Fourier transform is used to…
The graph Fourier transform (GFT) is a fundamental tool in graph signal processing and has recently been extended to the graph fractional Fourier transform (GFRFT). Existing sampling methods in the GFRFT domain are primarily designed to…
In this paper we study the nonuniform fast Fourier transform with nonequispaced spatial and frequency data (NNFFT) and the fast sinc transform as its application. The computation of NNFFT is mainly based on the nonuniform fast Fourier…
This paper proposes a new loss using short-time Fourier transform (STFT) spectra for the aim of training a high-performance neural speech waveform model that predicts raw continuous speech waveform samples directly. Not only amplitude…
Using the notions of frame transform and of square integrable projective representation of a locally compact group $G$, we introduce a class of isometries (tight frame transforms) from the space of Hilbert-Schmidt operators in the carrier…
S-matrix is one of the fundamental observables of the quantum theory of relativistic particles. There have been attempts to understand the quantum dynamics of relativistic particles abstractly in terms of S-matrix bypassing a Lagrangian…
In this paper, we discuss the development of a sublinear sparse Fourier algorithm for high-dimensional data. In ``Adaptive Sublinear Time Fourier Algorithm" by D. Lawlor, Y. Wang and A. Christlieb (2013), an efficient algorithm with…