Related papers: Robust Sparse Fourier Transform Based on The Fouri…
Fourier transform spectroscopy (FTS) has been widely used as an analytical tool for many applications in science and engineering. In this paper, we describe the operation principle and practical implementation of an FTS prototype. First,…
The Fast Fourier Transform (FFT) is a fundamental tool for signal analysis, widely used across various fields. However, traditional FFT methods encounter challenges in adjusting the frequency bin interval, which may impede accurate spectral…
Traditional data collection from sensors produce a lot of data, which lead to constant power consumption and require more storage space. This study proposes an algorithm for a data acquisition and processing method based on Fourier…
The Discrete Fourier Transform (DFT) underpins the solution to many inverse problems commonly possessing missing or un-measured frequency information. This incomplete coverage of Fourier space always produces systematic artefacts called…
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show: * An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero…
Parameter Efficient Fine-Tuning (PEFT) is a key technique for adapting a large pretrained model to downstream tasks by fine-tuning only a small number of parameters. Recent methods based on Fourier transforms have further reduced the…
In this paper we consider the special case where a discrete signal ${\bf x}$ of length N is known to vanish outside a support interval of length $m < N$. If the support length $m$ of ${\bf x}$ or a good bound of it is a-priori known we…
Diffraction tomography (DT) has been widely explored in transmission-mode configurations, enabling high-resolution, label-free 3D imaging. However, industrial metrology applications, such as semiconductor inspection, typically involve…
By multiplexing information symbols in the delay-Doppler (DD) domain, orthogonal time frequency space (OTFS) is a promising candidate for future wireless communication in high-mobility scenarios. In addition to the superior communication…
In radar systems, high resolution in the Doppler dimension is important for detecting slow-moving targets as it allows for more distinct separation between these targets and clutter, or stationary objects. However, achieving sufficient…
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…
Radio imaging is rapidly gaining prominence in the design of future communication systems, with the potential to utilize reconfigurable intelligent surfaces (RISs) as imaging apertures. Although the sparsity of targets in three-dimensional…
The Discrete Fourier Transform (DFT) is central to the analysis of uniformly sampled signals, yet many practical applications involve non-uniform sampling, requiring the Non-Uniform Discrete Fourier Transform (NUDFT). While quantum…
The Fourier spectrum at a fractional period is often examined when extracting features from biological sequences and time series. It reflects the inner information structure of the sequences. A fractional period is not uncommon in time…
Orthogonal Time Frequency Space ({OTFS}) modulation offers significant advantages over Orthogonal Frequency Division Multiplexing ({OFDM}), particularly in high speed environments. Hence, we consider {OTFS} transmission over high-Doppler…
The Fast Fourier Transform (FFT) is a computationally intensive digital signal processing (DSP) function widely used in applications such as imaging, software-defined radio, wireless communication, instrumentation. In this paper, a…
Finite-rate-of-innovation (FRI) signals are ubiquitous in applications such as radar, ultrasound, and time of flight imaging. Due to their finite degrees of freedom, FRI signals can be sampled at sub-Nyquist rates using appropriate sampling…
The Fast Fourier Transform (FFT) is a numerical operation that transforms a function into a form comprised of its constituent frequencies and is an integral part of scientific computation and data analysis. The objective of our work is to…
Wireless OFDM channels can be approximated by a time varying filter with sparse time domain taps. Recent achievements in sparse signal processing such as compressed sensing have facilitated the use of sparsity in estimation, which improves…
A joint frame and carrier frequency synchronization algorithm for coherent optical systems, based on the digital computation of the fractional Fourier transform (FRFT), is proposed. The algorithm utilizes the characteristics of energy…