Corpus ID: 234741799

Data-driven Algorithms for signal processing with rational functions

  title={Data-driven Algorithms for signal processing with rational functions},
  author={Heather Wilber and Anil Damle and Alex Townsend},
Rational approximation schemes for reconstructing signals from samples with poorly separated spectral content are described. These methods are automatic and adaptive, requiring no tuning or manual parameter selection. Collectively, they form a framework for fitting trigonometric rational models to data that is robust to various forms of corruption, including additive Gaussian noise, perturbed sampling grids, and missing data. Our approach combines a variant of Prony’s method with a modified… Expand

Figures and Tables from this paper

From ESPRIT to ESPIRA: Estimation of Signal Parameters by Iterative Rational Approximation
A new method for Estimation of Signal Parameters based on Iterative Rational Approximation (ESPIRA) for sparse exponential sums and it is shown that ESPIRA can be interpreted as a matrix pencil method applied to Loewner matrices. Expand
AAA-least squares rational approximation and solution of Laplace problems
A two-step method for solving planar Laplace problems via rational approximation via AAA-LS approximation, which leads to a powerful method for computing the Hilbert transform or Dirichlet-toNeumann map. Expand


Rational approximation of frequency domain responses by vector fitting
The paper describes a general methodology for the fitting of measured or calculated frequency domain responses with rational function approximations. This is achieved by replacing a set of startingExpand
Nonlinear inversion of a band-limited Fourier transform
We consider the problem of reconstructing a compactly supported function with singularities either from values of its Fourier transform available only in a bounded interval or from a limited numberExpand
Solving Burgersʼ equation using optimal rational approximations
Abstract We solve viscous Burgersʼ equation using a fast and accurate algorithm—referred to here as the reduction algorithm—for computing near optimal rational approximations. Given a proper rationalExpand
The RKFIT Algorithm for Nonlinear Rational Approximation
This paper derives a strategy for the degree reduction of the approximants, as well as methods for their conversion to partial fraction form, for the efficient evaluation, and root-finding, and puts RKFIT into a general framework. Expand
Parameter estimation for nonincreasing exponential sums by Prony-like methods
Abstract Let z j : = e f j with f j ∈ ( - ∞ , 0 ] + i [ - π , π ) be distinct nodes for j = 1 , … , M . With complex coefficients c j ≠ 0 , we consider a nonincreasing exponential sum h ( x ) : = c 1Expand
Wavelets and signal processing
A simple, nonrigorous, synthetic view of wavelet theory is presented for both review and tutorial purposes. The discussion includes nonstationary signal analysis, scale versus frequency, waveletExpand
Nonlinear approximation by sums of nonincreasing exponentials
Many applications in electrical engineering, signal processing and mathematical physics lead to the following approximation problem: let h be a short linear combination of nonincreasing exponentialsExpand
Rational Function Systems in ECG Processing
This approach has advantages over the previously used transformation methods, for instance the system is designed particularly for ECG signals in the sense that the shape of the individual terms correspond to the natural segmentation of the signal. Expand
Sampling signals with finite rate of innovation
This work proves sampling theorems for classes of signals and kernels that generalize the classic "bandlimited and sinc kernel" case and shows how to sample and reconstruct periodic and finite-length streams of Diracs, nonuniform splines, and piecewise polynomials using sinc and Gaussian kernels. Expand
An algorithm for selecting a good value for the parameter c in radial basis function interpolation
  • S. Rippa
  • Mathematics, Computer Science
  • Adv. Comput. Math.
  • 1999
It is shown, numerically, that the value of the optimal c (the value of c that minimizes the interpolation error) depends on the number and distribution of data points, on the data vector, and on the precision of the computation. Expand