Related papers: Precise and Fast Phase Wraps Reduction in Fringe P…
The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…
X-ray Bragg coherent diffraction imaging has been demonstrated as a powerful three-dimensional (3D) microscopy approach for the investigation of sub-micrometer-scale crystalline particles. It is based on the measurement of a series of…
In this paper, we focus on the approximation of smooth functions $f: [-\pi, \pi] \rightarrow \mathbb{C}$, up to an unresolvable global phase ambiguity, from a finite set of Short Time Fourier Transform (STFT) magnitude (i.e., spectrogram)…
Iterative phase retrieval algorithms typically employ projections onto constraint subspaces to recover the unknown phases in the Fourier transform of an image, or, in the case of x-ray crystallography, the electron density of a molecule.…
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…
This research work focuses on the design of a high-resolution fast Fourier transform (FFT) /inverse fast Fourier transform (IFFT) processors for constraints analysis purpose. Amongst the major setbacks associated with such high resolution,…
Two-dimensional Fourier transform plays a significant role in a variety of image processing problems, such as medical image processing, digital holography, correlation pattern recognition, hybrid digital optical processing, optical…
Affine frequency division multiplexing (AFDM) and orthogonal AFDM access (O-AFDMA) are promising techniques based on chirp signals, which are able to suppress the performance deterioration caused by Doppler shifts in high-mobility…
The one-dimensional (1D) fractional Fourier transform (FRFT) generalizes the Fourier transform, offering significant advantages in the time-frequency analysis of non-stationary signals. While various 2D extensions exist, such as the 2D…
In this paper, we extend our method [1] for FMCW radar mutual interference mitigation (IM) based on the discrete fractional Fourier transform (DFrFT). Firstly, we propose a radar signal processing chain including our DFrFT-based IM for…
Fast Fourier Transforms (FFT) are widely used to reduce memory and computational costs in deep learning. However, existing implementations, including standard FFT and real FFT (rFFT), cannot achieve true in-place computation. In particular,…
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 fast algorithms in Fourier optics have invigorated multifunctional device design and advanced imaging technologies. However, the necessity for fast computations has led to limitations in the widely used conventional Fourier methods,…
The stair phase coding patterns have been widely used to determine the fringe order for phase unwrapping of the wrapped phase in 3D shape measurement. Although the special coding sequence algorithm can achieve with a large number of…
Foundation models have achieved tremendous success in different domains. However, their huge computation and storage complexity make these models difficult to fine-tune and also less applicable in practice. Recent study shows training in…
Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the…
Dispersive Fourier transformation is a powerful technique in which spectral information is mapped into the time domain using chromatic dispersion. It replaces a spectrometer with an electronic digitizer, and enables real-time spectroscopy.…
Spatial and temporal delays in a wireless multi-antenna system, paired with an orthogonal frequency division multiplexing (OFDM) waveform, can be utilized to estimate the Angle of Arrival (AoA) and Time of Arrival (ToA) of scatterers in the…
This paper presents a novel frequency-domain approach for path following problem, specifically designed to handle paths described by discrete data. The proposed algorithm utilizes the fast Fourier Transform (FFT) to process the discrete…
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…