Related papers: Frequency-Undersampled Short-Time Fourier Transfor…
We have constructed a Fourier-transform spectrometer (FTS) operating between 50 and 330 GHz with minimum volume (355 x260 x64 mm) and weight (13 lbs) while maximizing optical throughput (100 $\mathrm{mm}^2$ sr) and optimizing the spectral…
This paper introduces a design method for densergraph-frequency graph Fourier frames (DGFFs) to enhance graph signal processing and analysis. The graph Fourier transform (GFT) enables us to analyze graph signals in the graph spectral domain…
The non-equidistant fast Fourier transform (NFFT) is an extension of the famous fast Fourier transform (FFT), which can be applied to non-equidistantly sampled data in time/space or frequency domain. It is an approximative algorithm that…
Separating vocal elements from musical tracks is a longstanding challenge in audio signal processing. This study tackles the distinct separation of vocal components from musical spectrograms. We employ the Short Time Fourier Transform…
We present the Evolving Graph Fourier Transform (EFT), the first invertible spectral transform that captures evolving representations on temporal graphs. We motivate our work by the inadequacy of existing methods for capturing the evolving…
Analysis of 1H-NMR spectra is often hindered by large variations that occur during the collection of these spectra. Large solvent and standard peaks, base line drift and negative peaks (due to improper phasing) are among some of these…
Many real-world time series exhibit strong periodic structures arising from physical laws, human routines, or seasonal cycles. However, modern deep forecasting models often fail to capture these recurring patterns due to spectral bias and a…
Previous unsupervised domain adaptation methods did not handle the cross-domain problem from the perspective of frequency for computer vision. The images or feature maps of different domains can be decomposed into the low-frequency…
We propose the development of an instrument by the Martin & Puplett-type Fourier Transform Spectrometer to applying the aperture synthesis technique in millimeter and submillimeter waves. We call this equipment the Multi-Fourier Transform…
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…
One of the major challenges of employing a dual-frequency phase-shifting algorithm for phase retrieval is its sensitivity to noise. Yun et. al [H Yun, B Li, S Zhang. 2017] proposed a dual-frequency method based on the Fourier transform…
The paper presents the graph Fourier transform (GFT) of a signal in terms of its spectral decomposition over the Jordan subspaces of the graph adjacency matrix $A$. This representation is unique and coordinate free, and it leads to…
Background: Windowed Fourier decompositions (WFD) are widely used in measuring stationary and non-stationary spectral phenomena and in describing pairwise relationships among multiple signals. Although a variety of WFDs see frequent…
The Fourier-transform scanning tunneling spectroscopy (FTSTS) contains rich signals related to the quasiparticle scattering interference and/or the density-wave-like orders which are crucial in interpretation of the ground states and the…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
The free metaplectic transformation (FMT) has gained much popularity in recent times because of its various application in signal processing, paraxial optical systems, digital algorithms, optical encryption and so on. However, the FMT is…
Graph spectral representations are fundamental in graph signal processing, offering a rigorous framework for analyzing and processing graph-structured data. The graph fractional Fourier transform (GFRFT) extends the classical graph Fourier…
The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the fact that its runtime…
We develop the basic building blocks of a frequency domain framework for drawing statistical inferences on the second-order structure of a stationary sequence of functional data. The key element in such a context is the spectral density…
I discuss the nature of a Fractional Discrete Fourier Transform (FrDFT) described algorithmically by a combination of chirp transforms and ordinary DFTs. The transform is shown to be consistent with a continuous two-dimensional rotation…