CramÉr–Rao Bounds for Multiple Poles and Coefficients of Quasi-Polynomials in Colored Noise
From MaRDI portal
Publication:4569010
Cited in
(5)- Efficient Monte Carlo computation of Fisher information matrix using prior information
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- Particularities and commonalities of singular spectrum analysis as a method of time series analysis and signal processing
- Stability and super-resolution of generalized spike recovery
- Sparse polynomial interpolation in Chebyshev bases
This page was built for publication: CramÉr–Rao Bounds for Multiple Poles and Coefficients of Quasi-Polynomials in Colored Noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569010)