Related papers: Fast and Accurate Frequency Estimation Using Slidi…
Estimating closely spaced frequency components of a signal is a fundamental problem in statistical signal processing. In this letter, we introduce 1-D real-valued and complex-valued shifted window (Swin) transformers, referred to as…
This paper presents a gradient-based method for on-the-fly optimization for both per-frame and per-frequency window length of the short-time Fourier transform (STFT), related to previous work in which we developed a differentiable version…
Continuous phase estimation is known to be superior in accuracy as compared to static estimation. The estimation process is, however, desired to be made robust to uncertainties in the underlying parameters. Here, homodyne phase estimation…
This contribution is a follow-up of a recent paper by the authors on adaptive, non-linear time-frequency transforms, focusing on the STFT based transforms. The adaptivity is provided by a focus function, that depends on the analyzed…
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…
Encoding frequency stability constraints in the operation problem is challenging due to its complex dynamics. Recently, data-driven approaches have been proposed to learn the stability criteria offline with the trained model embedded as a…
Recently, it has been demonstrated experimentally that adaptive estimation of a continuously varying optical phase provides superior accuracy in the phase estimate compared to static estimation. Here, we show that the mean-square error in…
We propose a new residual-based a posteriori error estimator for discontinuous Galerkin discretizations of time-harmonic Maxwell's equations in first-order form. We establish that the estimator is reliable and efficient, and the dependency…
Covariance matrix estimation is an important problem in multivariate data analysis, both from theoretical as well as applied points of view. Many simple and popular covariance matrix estimators are known to be severely affected by model…
The study addresses the problem of precision in floating-point (FP) computations. A method for estimating the errors which affect intermediate and final results is proposed and a summary of many software simulations is discussed. The basic…
Within the well-established optical response function formalism, a new strategy with the central idea of employing the forward-backward stochastic Schr\"{o}dinger equations in a segmented way to accurately obtain the two-dimensional (2D)…
Computation of the spherical harmonic rotation coefficients or elements of Wigner's d-matrix is important in a number of quantum mechanics and mathematical physics applications. Particularly, this is important for the Fast Multipole Methods…
Fourier transform methods are used to analyze functions and data sets to provide frequencies, amplitudes, and phases of underlying oscillatory components. Fast Fourier transform (FFT) methods offer speed advantages over evaluation of…
In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…
Finite difference (FD) approximation is a classic approach to stochastic gradient estimation when only noisy function realizations are available. In this paper, we first provide a sample-driven method via the bootstrap technique to estimate…
The problem of local damage diagnosis (based on the detection of impulsive and periodic signals) is discussed. Both features should be checked, as fault frequency must be linked to the true value calculated for a given machine and speed.…
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…
The recently developed frequency extraction algorithm [G.R. Werner and J.R. Cary, J. Comp. Phys. 227, 5200 (2008)] that enables a simple FDTD algorithm to be transformed into an efficient eigenmode solver is applied to a realistic…
In this paper we establish the accuracy and robustness of a fast estimator for the bispectrum - the "FFT bispectrum estimator". The implementation of the estimator presented here offers speed and simplicity benefits over a direct sampling…
Parametric estimation for diffusion processes is considered for high frequency observations over a fixed time interval. The processes solve stochastic differential equations with an unknown parameter in the diffusion coefficient. We find…