English
Related papers

Related papers: Accurate Frequency Estimation with Fewer DFT Inter…

200 papers

We study Pad\'{e} interpolation at the node $z=0$ of functions $f(z)=\sum_{m=0}^{\infty} f_m z^m$, analytic in a neighbourhood of this node, by amplitude and frequency operators (sums) of the form $$ \sum_{k=1}^n \mu_k h(\lambda_k z),…

Classical Analysis and ODEs · Mathematics 2016-03-08 Petr Chunaev , Vladimir Danchenko

The number of phase wraps in 2D wrapped phase map can be completely eliminated, or greatly reduced by frequency shifting. But the wraps usually cannot be optimally reduced using the conventional fast Fourier transform (FFT) because the…

Instrumentation and Detectors · Physics 2017-10-11 Minmin Wang , Guangliang Du , Canlin Zhou , Shuchun Si , Zhenkun Lei , XiaoLei Li , YanJie Li

An adaptive interpolation scheme is proposed to accurately calculate the wideband responses in electromagnetic simulations. In the proposed scheme, the sampling points are first carefully divided into several groups based on their responses…

Computational Engineering, Finance, and Science · Computer Science 2022-03-14 Kai Zhu , Jinhui Wang , Shunchuan Yang

Affine Frequency Division Multiplexing (AFDM), which is based on discrete affine Fourier transform (DAFT), has recently been proposed for reliable communication in high-mobility scenarios. Two low complexity detectors for AFDM are…

Information Theory · Computer Science 2022-03-08 Ali Bemani , Nassar Ksairi , Marios Kountouris

In many processes, the variations in underlying characteristics can be approximated by noisy multi-periodic patterns. If large-scale patterns are superimposed by a noise with long-range correlations, the detection of multi-periodic patterns…

Quantitative Methods · Quantitative Biology 2019-12-09 V. R. Chechetkin , V. V. Lobzin

Affine Frequency Division Multiplexing (AFDM), a new chirp-based multicarrier waveform for high mobility communications, is introduced here. AFDM is based on discrete affine Fourier transform (DAFT), a generalization of discrete Fourier…

Information Theory · Computer Science 2022-05-04 Ali Bemani , Nassar Ksairi , Marios Kountouris

This correspondence presents an efficient method for reconstructing a band-limited signal in the discrete domain from its crossings with a sine wave. The method makes it possible to design A/D converters that only deliver the crossing…

Information Theory · Computer Science 2016-11-17 J. Selva

Vector-valued discrete Fourier transforms (DFTs) and ambiguity functions are defined. The motivation for the definitions is to provide realistic modeling of multi-sensor environments in which a useful time-frequency analysis is essential.…

Functional Analysis · Mathematics 2017-06-20 Travis D. Andrews , John J. Benedetto , Jeffrey J. Donatelli

Extremely large antenna arrays (ELAAs) operating in high-frequency bands have spurred the development of near-field communication, driving advancements in beam training design. This paper introduces an efficient near-field beam training…

Signal Processing · Electrical Eng. & Systems 2025-05-21 Zijun Wang , Rama Kiran , Shawn Tsai , Rui Zhang

For future wireless communication technologies, an increase in capabilities such as throughput is strongly expected. Transmission in the sub-THz bands (>90 GHz) seems to be the potential solution to meet the ever-increasing capacity demands…

Information Theory · Computer Science 2022-12-14 Yaya Bello , Jean-Baptiste-Doré , David Demmer

We propose a topology optimisation of acoustic devices that work in a certain bandwidth. To achieve this, we define the objective function as the frequency-averaged sound intensity at given observation points, which is represented by a…

Numerical Analysis · Mathematics 2023-05-16 Yuta Honshuku , Hiroshi Isakari

Phase retrieval from phaseless short-time Fourier transform (STFT) measurements is known to be inherently unstable when measurements are taken with respect to a single window. While an explicit inversion formula exists, it is useless in…

Functional Analysis · Mathematics 2025-06-19 Rima Alaifari , Yunan Yang

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…

Numerical Analysis · Mathematics 2025-05-01 Laslo Hunhold , John Gustafson

The recent proposed affine frequency division multiplexing (AFDM) employing a multi-chirp waveform has shown its reliability and robustness in doubly selective fading channels. In the existing embedded pilot-aided channel estimation…

Signal Processing · Electrical Eng. & Systems 2024-04-17 Kai Zheng , Miaowen Wen , Tianqi Mao , Lixia Xiao , Zhaocheng Wang

Cross-domain few-shot learning (CD-FSL) requires models to generalize from limited labeled samples under significant distribution shifts. While recent methods enhance adaptability through lightweight task-specific modules, they operate…

Computer Vision and Pattern Recognition · Computer Science 2025-05-14 Ruixiao Shi , Fu Feng , Yucheng Xie , Jing Wang , Xin Geng

Resampling by interpolation is the traditional method to process interferograms from non-uniformly sampled Fourier transform spectrometers. The non-uniform fast Fourier transform (NUFFT) is an alternative approach that has been mostly…

Instrumentation and Detectors · Physics 2024-12-10 Muqian Wen , John Houlihan

In this paper we present a Fourier feature based deep domain decomposition method (F-D3M) for partial differential equations (PDEs). Currently, deep neural network based methods are actively developed for solving PDEs, but their efficiency…

Numerical Analysis · Mathematics 2022-05-05 Sen Li , Yingzhi Xia , Yu Liu , Qifeng Liao

Incipient fault detection in power distribution systems is crucial to improve the reliability of the grid. However, the non-stationary nature and the inadequacy of the training dataset due to the self-recovery of the incipient fault signal,…

Signal Processing · Electrical Eng. & Systems 2023-02-21 Qiyue Li , Huan Luo , Hong Cheng , Yuxing Deng , Wei Sun , Weitao Li , Zhi Liu

DFT is the numerical implementation of Fourier transform (FT), and it has many forms. Ordinary DFT (ODFT) and symmetric DFT (SDFT) are the two main forms of DFT. The most widely used DFT is ODFT, and the phase spectrum of this form is…

Information Theory · Computer Science 2021-08-27 Rui Li

We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial differential equations with random coefficients. The algorithm is an adaption of the sparse…

Numerical Analysis · Mathematics 2022-09-05 Lutz Kämmerer , Daniel Potts , Fabian Taubert