TY - JOUR

T1 - Fine Quantization in Signal Detection and Estimation

AU - Poor, H. Vincent

N1 - Funding Information:
Manuscript received October 28, 1986; revised October 22, 1987. This paper was presented in part at the 1985 IEEE International Symposium on Information Theory, Brighton. England, June 23-29, 1985. This work was supported by the Joint Services Electronics Program under Contract N00014-84-C-0149.

PY - 1988/9

Y1 - 1988/9

N2 - The performance lost to data quantization in signal detection and estimation procedures is considered. Assuming that observations lie in R”, a general result giving the f-divergence lost to fine uniform quantization is developed. In particular it is shown that, for a random n-vector, X, a convex function f:R-R, and a smooth function l:Rn-R, we have E{ f(l(X))} -E{f(E{ l(X)|fΔ})} ~ Δ2/24E{||∇l(X)||2fn(X)}, where, for each Δ 0, F is any sub-a-field of Bngenerated by uniform partitioning of Rn into n-dimensional cubes with side Δ This general result is applied to obtain specific asymptotic expressions for the performance lost to uniform data quantization in several signal detection and estimation problems including minimum mean-squared error (mmse) estimation, nonrandom point estimation, and binary signal detection. Numerical results illustrating the closeness of the approximation implied by the above result are also given. An analogous expression for the divergence lost to companded (nonuniform) data quantization also is developed, and the compander that minimizes the divergence loss is derived.

AB - The performance lost to data quantization in signal detection and estimation procedures is considered. Assuming that observations lie in R”, a general result giving the f-divergence lost to fine uniform quantization is developed. In particular it is shown that, for a random n-vector, X, a convex function f:R-R, and a smooth function l:Rn-R, we have E{ f(l(X))} -E{f(E{ l(X)|fΔ})} ~ Δ2/24E{||∇l(X)||2fn(X)}, where, for each Δ 0, F is any sub-a-field of Bngenerated by uniform partitioning of Rn into n-dimensional cubes with side Δ This general result is applied to obtain specific asymptotic expressions for the performance lost to uniform data quantization in several signal detection and estimation problems including minimum mean-squared error (mmse) estimation, nonrandom point estimation, and binary signal detection. Numerical results illustrating the closeness of the approximation implied by the above result are also given. An analogous expression for the divergence lost to companded (nonuniform) data quantization also is developed, and the compander that minimizes the divergence loss is derived.

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

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

U2 - 10.1109/18.21219

DO - 10.1109/18.21219

M3 - Article

AN - SCOPUS:0024079242

VL - 34

SP - 960

EP - 972

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

ER -