Recursive consistent estimation with bounded noise

Sundeep Rangan, Vivek K. Goyal

Research output: Contribution to journalArticle

Abstract

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/n 2), where n is the number of samples. This rate is faster than the ο(1/n) MSE obtained by standard recursive least squares estimation and is optimal to within a constant factor.

Original languageEnglish (US)
Pages (from-to)457-464
Number of pages8
JournalIEEE Transactions on Information Theory
Volume47
Issue number1
DOIs
StatePublished - Jan 2001

Fingerprint

Mean square error
reconstruction

Keywords

  • Consistent reconstruction
  • Dithered quantization
  • Frames
  • Overcomplete representations
  • Overdetermined linear equations

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Information Systems

Cite this

Recursive consistent estimation with bounded noise. / Rangan, Sundeep; Goyal, Vivek K.

In: IEEE Transactions on Information Theory, Vol. 47, No. 1, 01.2001, p. 457-464.

Research output: Contribution to journalArticle

@article{819d178506dd49c8967211d9ccd99c8c,
title = "Recursive consistent estimation with bounded noise",
abstract = "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/n 2), where n is the number of samples. This rate is faster than the ο(1/n) MSE obtained by standard recursive least squares estimation and is optimal to within a constant factor.",
keywords = "Consistent reconstruction, Dithered quantization, Frames, Overcomplete representations, Overdetermined linear equations",
author = "Sundeep Rangan and Goyal, {Vivek K.}",
year = "2001",
month = "1",
doi = "10.1109/18.904562",
language = "English (US)",
volume = "47",
pages = "457--464",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Recursive consistent estimation with bounded noise

AU - Rangan, Sundeep

AU - Goyal, Vivek K.

PY - 2001/1

Y1 - 2001/1

N2 - 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/n 2), where n is the number of samples. This rate is faster than the ο(1/n) MSE obtained by standard recursive least squares estimation and is optimal to within a constant factor.

AB - 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/n 2), where n is the number of samples. This rate is faster than the ο(1/n) MSE obtained by standard recursive least squares estimation and is optimal to within a constant factor.

KW - Consistent reconstruction

KW - Dithered quantization

KW - Frames

KW - Overcomplete representations

KW - Overdetermined linear equations

UR - http://www.scopus.com/inward/record.url?scp=0035089196&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035089196&partnerID=8YFLogxK

U2 - 10.1109/18.904562

DO - 10.1109/18.904562

M3 - Article

AN - SCOPUS:0035089196

VL - 47

SP - 457

EP - 464

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 1

ER -