Entropy of Highly Correlated Quantized Data

This paper considers the entropy of highly correlated quantized samples. Two results are shown. The first concerns sampling and identically scalar quantizing a stationary continuous-time random process over a finite interval. It is shown that if the process crosses a quantization threshold with positive probability, then the joint entropy of the quantized samples tends to infinity as the sampling rate goes to infinity. The second result provides an upper bound to the rate at which the joint entropy tends to infinity, in the case of an infinite-level uniform threshold scalar quantizer and a stationary Gaussian random process. Specifically, an asymptotic formula for the conditional entropy of one quantized sample conditioned on the previous quantized sample is derived. At high sampling rates, these results indicate a sharp contrast between the large encoding rate (in bits/sec) required by a lossy source code consisting of a fixed scalar quantizer and an ideal, sampling-rate-adapted lossless code, and the bounded encoding rate required by an ideal lossy source code operating at the same distortion.

[1]  David L. Neuhoff,et al.  Quantization , 2022, IEEE Trans. Inf. Theory.

[2]  David Slepian Estimation of the Gauss-Markov process from observation of its sign , 1983 .

[3]  Daniel Marco,et al.  Markov Random Processes Are Neither Bandlimited nor Recoverable From Samples or After Quantization , 2009, IEEE Transactions on Information Theory.

[4]  Martin Vetterli,et al.  Deterministic analysis of oversampled A/D conversion and decoding improvement based on consistent estimates , 1994, IEEE Trans. Signal Process..

[5]  Mingyan Liu,et al.  On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data , 2003, IPSN.

[6]  Baltasar Beferull-Lozano,et al.  Power-efficient sensor placement and transmission structure for data gathering under distortion constraints , 2006, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[7]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[8]  Cathy H. Xia,et al.  Distributed source coding in dense sensor networks , 2005, Data Compression Conference.

[9]  Martin Vetterli,et al.  Error-Rate Characteristics of Oversampled Analog-to-Digital Conversion , 1998, IEEE Trans. Inf. Theory.

[10]  M. R. Leadbetter,et al.  Extremes and Related Properties of Random Sequences and Processes: Springer Series in Statistics , 1983 .

[11]  Shlomo Shamai Information rates by oversampling the sign of a bandlimited process , 1994, IEEE Trans. Inf. Theory.

[12]  Kannan Ramchandran,et al.  Distributed Sampling for Dense Sensor Networks: A "Bit-Conservation Principle" , 2003, IPSN.

[13]  Mingyan Liu,et al.  Data-gathering wireless sensor networks: organization and capacity , 2003, Comput. Networks.

[14]  J. Galambos Review: M. R. Leadbetter, Georg Lindgren and Holger Rootzen, Extremes and related properties of random sequences and processes , 1985 .

[15]  Jacob Ziv,et al.  On universal quantization , 1985, IEEE Trans. Inf. Theory.

[16]  Anna Scaglione,et al.  On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks , 2002, MobiCom '02.

[17]  J. Neveu,et al.  Mathematical foundations of the calculus of probability , 1965 .

[18]  I. M. Jacobs,et al.  Principles of Communication Engineering , 1965 .

[19]  K. Ramchandran,et al.  On distributed sampling of smooth non-bandlimited fields , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[20]  Israel Bar-David,et al.  An Implicit Sampling Theorem for Bounded Bandlimited Functions , 1974, Inf. Control..

[21]  Martin Vetterli,et al.  On simple oversampled A/D conversion in L2(IR) , 2001, IEEE Trans. Inf. Theory.

[22]  Israel Bar-David Sample functions of a Gaussian process cannot be recovered from their zero crossings (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[23]  David L. Neuhoff,et al.  An Upper Bound to the Rate of Ideal Distributed Lossy Source Coding of Densely Sampled Data , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[24]  Daniel Marco Asymptotic quantization and applications to sensor networks. , 2004 .

[25]  Ingrid Daubechies,et al.  Single-Bit Oversampled A/D Conversion With Exponential Accuracy in the Bit Rate , 2007, IEEE Transactions on Information Theory.

[26]  Herbert Gish,et al.  Asymptotically efficient quantizing , 1968, IEEE Trans. Inf. Theory.

[27]  Martin Vetterli,et al.  Reduction of the MSE in R-times oversampled A/D conversion O(1/R) to O(1/R2) , 1994, IEEE Trans. Signal Process..

[28]  David L. Neuhoff,et al.  Low-resolution scalar quantization for Gaussian sources and squared error , 2006, IEEE Transactions on Information Theory.

[29]  Martin Vetterli,et al.  On Simple Oversampled A/D Conversion in , 2001 .