Recursive consistent estimation with bounded noise

DOI10.1109/18.904562zbMath1002.94517OpenAlexW2120058354MaRDI QIDQ4544497

Vivek K. Goyal, Sundeep Rangan

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/73953022030a15922143f32e7202919426aa3a6c

zbMATH Keywords

consistent reconstructionconsistent estimationovercomplete representationsoverdetermined linear equationsdithered quantizationovercomplete linear expansions

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (15)

Error bounds for consistent reconstruction: random polytopes and coverage processes ⋮ Error-constrained finite-horizon tracking control with incomplete measurements and bounded noises ⋮ Approximate message passing with spectral initialization for generalized linear models* ⋮ Almost sure convergence of the Kaczmarz algorithm with random measurements ⋮ Bilinear square functions and vector-valued Calderón-Zygmund operators ⋮ Fundamental limits of weak recovery with applications to phase retrieval ⋮ Quadratic covariance‐constrained filtering for linear and non‐linear systems with non‐Gaussian noises ⋮ Pointwise comparison of PCM and \(\Sigma \Delta \) quantization ⋮ Finite sample performance of linear least squares estimation ⋮ Quantization and Finite Frames ⋮ Frame permutation quantization ⋮ Quantized frame expansions with erasures ⋮ Mean squared error bounds for the Rangan-Goyal soft thresholding algorithm ⋮ Optimal combination of linear and spectral estimators for generalized linear models ⋮ Iteratively consistent one-bit phase retrieval

This page was built for publication: Recursive consistent estimation with bounded noise