ESPRIT versus ESPIRA for reconstruction of short cosine sums and its application

04/07/2022
by   Nadiia Derevianko, et al.
0

In this paper we introduce two new algorithms for stable approximation with and recovery of short cosine sums. The used signal model contains cosine terms with arbitrary real positive frequency parameters and therefore strongly generalizes usual Fourier sums. The proposed methods both employ a set of equidistant signal values as input data. The ESPRIT method for cosine sums is a Prony-like method and applies matrix pencils of Toeplitz+Hankel matrices while the ESPIRA method is based on rational approximation of DCT data and can be understood as a matrix pencil method for special Loewner matrices. Compared to known numerical methods for recovery of exponential sums, the design of the considered new algorithms directly exploits the special real structure of the signal model and therefore usually provides real parameter estimates for noisy input data, while the known general recovery algorithms for complex exponential sums tend to yield complex parameters in this case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/29/2021

From ESPRIT to ESPIRA: Estimation of Signal Parameters by Iterative Rational Approximation

We introduce a new method for Estimation of Signal Parameters based on I...
research
07/25/2023

Differential approximation of the Gaussian by short cosine sums with exponential error decay

In this paper we propose a method to approximate the Gaussian function o...
research
03/13/2021

Exact Reconstruction of Extended Exponential Sums using Rational Approximation of their Fourier Coefficients

In this paper we derive a new recovery procedure for the reconstruction ...
research
11/26/2020

Exact Reconstruction of Sparse Non-Harmonic Signals from Fourier Coefficients

In this paper, we derive a new reconstruction method for real non-harmon...
research
02/05/2021

Cosine Series Representation

This short paper is based on Chung et al. (2010), where the cosine serie...
research
09/01/2023

Adaptive function approximation based on the Discrete Cosine Transform (DCT)

This paper studies the cosine as basis function for the approximation of...
research
01/17/2018

Efficient Computation of the 8-point DCT via Summation by Parts

This paper introduces a new fast algorithm for the 8-point discrete cosi...

Please sign up or login with your details

Forgot password? Click here to reset