Recursive consistent estimation with bounded noise

@article{Rangan2001RecursiveCE,
  title={Recursive consistent estimation with bounded noise},
  author={Sundeep Rangan and Vivek K. Goyal},
  journal={IEEE Trans. Information Theory},
  year={2001},
  volume={47},
  pages={457-464}
}
Estimation problems with bounded, uniformly distributed noise arise naturally in reconstruction problems from over complete linear expansions with subtractive dithered quantization. We present a simple recursive algorithm for such bounded-noise estimation problems. The mean-square error (MSE) of the algorithm is “almost” (1 ), where is the number of samples. This rate is faster than the (1 ) MSE obtained by standard recursive least squares estimation and is optimal to within a constant factor. 
Highly Cited
This paper has 57 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 35 extracted citations

58 Citations

0510'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Stochastic Approximation Algorithms and Applications

  • H. J. Kushner, C. G. Lin
  • New York: Springer-Verlag,
  • 1997
Highly Influential
5 Excerpts

Theory and Practice of Recursive Identification

  • L. Ljung
  • 1983
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…