TY - GEN

T1 - Timely Estimation Using Coded Quantized Samples

AU - Arafa, Ahmed

AU - Banawan, Karim

AU - Seddik, Karim G.

AU - Vincent Poor, H.

N1 - Funding Information:
This work was supported in part by the U.S. National Science Foundation under Grants CCF-0939370 and CCF-1513915.

PY - 2020/6

Y1 - 2020/6

N2 - The effects of quantization and coding on the estimation quality of a Gauss-Markov, namely Ornstein-Uhlenbeck, process are considered. Samples are acquired from the process, quantized, and then encoded for transmission using either infinite incremental redundancy or fixed redundancy coding schemes. A fixed processing time is consumed at the receiver for decoding and sending feedback to the transmitter. Decoded messages are used to construct a minimum mean square error (MMSE) estimate of the process as a function of time. This is shown to be an increasing functional of the age-of-information, defined as the time elapsed since the sampling time pertaining to the latest successfully decoded message. Such (age-penalty) functional depends on the quantization bits, codeword lengths and receiver processing time. The goal, for each coding scheme, is to optimize sampling times such that the long term average MMSE is minimized. This is then characterized in the setting of general increasing age-penalty functionals, not necessarily corresponding to MMSE, which may be of independent interest in other contexts.

AB - The effects of quantization and coding on the estimation quality of a Gauss-Markov, namely Ornstein-Uhlenbeck, process are considered. Samples are acquired from the process, quantized, and then encoded for transmission using either infinite incremental redundancy or fixed redundancy coding schemes. A fixed processing time is consumed at the receiver for decoding and sending feedback to the transmitter. Decoded messages are used to construct a minimum mean square error (MMSE) estimate of the process as a function of time. This is shown to be an increasing functional of the age-of-information, defined as the time elapsed since the sampling time pertaining to the latest successfully decoded message. Such (age-penalty) functional depends on the quantization bits, codeword lengths and receiver processing time. The goal, for each coding scheme, is to optimize sampling times such that the long term average MMSE is minimized. This is then characterized in the setting of general increasing age-penalty functionals, not necessarily corresponding to MMSE, which may be of independent interest in other contexts.

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

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

U2 - 10.1109/ISIT44484.2020.9174086

DO - 10.1109/ISIT44484.2020.9174086

M3 - Conference contribution

AN - SCOPUS:85090425691

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1812

EP - 1817

BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020

Y2 - 21 July 2020 through 26 July 2020

ER -