相关论文: Continuous window functions for NFFT

We propose an efficient and accurate solver for the nonlocal potential in the Davey-Stewartson equation using nonuniform FFT (NUFFT). A discontinuity in the Fourier transform of the nonlocal potential causes accuracy locking if the…

The fast reconstruction of a bandlimited function from its sample data is an essential problem in signal processing. In this paper, we consider the widely used Gaussian regularized Shannon sampling formula in comparison to regularized…

With the advancements in computing technology and web-based applications, data is increasingly generated in multi-dimensional form. This data is usually sparse due to the presence of a large number of users and fewer user interactions. To…

The Fast Fourier Transform(FFT) is a classic signal processing algorithm that is utilized in a wide range of applications. For image processing, FFT computes on every pixel's value of an image, regardless of their properties in frequency…

In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\mathbf{\hat{f}} \in \mathbb{C}^N$ of any given input vector…

The main result of this paper is, that if we suppose that a function is absolutely continuous and uniformly H\"older continuous and that its finite difference function does not oscillate infinitely often on a bounded interval, then the…

The state-of-the-art automotive radars employ multidimensional discrete Fourier transforms (DFT) in order to estimate various target parameters. The DFT is implemented using the fast Fourier transform (FFT), at sample and computational…

An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…

It is demonstrated is this letter that linear multistep methods for integrating ordinary differential equations can be used to develop a family of fast forward scattering algorithms with higher orders of convergence. Excluding the cost of…

We present a new algorithm for the 2D Sliding Window Discrete Fourier Transform (SWDFT). Our algorithm avoids repeating calculations in overlapping windows by storing them in a tree data-structure based on the ideas of the Cooley- Tukey…

Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…

Fast Fourier Transforms (FFTs) are exploited in a wide variety of fields ranging from computer science to natural sciences and engineering. With the rising data production bandwidths of modern FFT applications, judging best which…

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…

We present an efficient, fast and robust Nonlinear Fourier Transform (NFT) algorithm to detect eigenvalues of the discrete spectrum. It outperforms other known NFT algorithms as it detects the eigenvalues from the continuous spectrum, the…

We study the dynamic structure factor of fluctuating elastic thin sheets subject to conservative (athermal) random forcing. In Steinbock, Katzav & Boudaoud, Phys. Rev. Research 4, 033096 (2022), the static structure factor of such a sheet…

We first review the convolution fast-Fourier-transform (CFFT) approach for the numerical solution of backward stochastic differential equations (BSDEs) introduced in (Hyndman and Oyono Ngou, 2017). We then propose a method for improving the…

We propose a high-precision numerical quadrature framework based on local Fourier extension (LFE) approximations. The method constructs, on each subinterval, a truncated-SVD stabilized local Fourier continuation of the integrand on an…

The properties of the Gabor and Morlet transforms are examined with respect to the Fourier analysis of discretely sampled data. Forward and inverse transform pairs based on a fixed window with uniform sampling of the frequency axis can…

Based on the sampling theorem, interpolation should be conducted by employing the sinc functions as the kernels. Inspired by the fact that the discrete Fourier transform (DFT) is sampled from the discrete time Fourier transform, a fast…

By viewing the nonuniform discrete Fourier transform (NUDFT) as a perturbed version of a uniform discrete Fourier transform, we propose a fast, stable, and simple algorithm for computing the NUDFT that costs $\mathcal{O}(N\log…