Optimal Source Codes for Timely Updates

Mayekar, P and Parag, P and Tyagi, H (2020) Optimal Source Codes for Timely Updates. In: IEEE Transactions on Information Theory, 66 (6). pp. 3714-3731.

PDF IEEE_TRA_INF_THE_66_6_3714-3731_2020.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

A transmitter observing a sequence of independent and identically distributed random variables seeks to keep a receiver updated about its latest observations. The receiver need not be apprised about each symbol seen by the transmitter, but needs to output a symbol at each time instant t. If at time t the receiver outputs the symbol seen by the transmitter at time U(t)leq t, the age of information at the receiver at time t is t-U(t). We study the design of lossless source codes that enable transmission with minimum average age at the receiver. We show that the asymptotic minimum average age can be attained up to a constant gap by the Shannon codes for a tilted version of the original pmf generating the symbols, which can be computed easily by solving an optimization problem. Furthermore, we exhibit an example with alphabet mathcal X where Shannon codes for the original pmf incur an asymptotic average age of a factor O(sqrt log | mathcal X|) more than that achieved by our codes. Underlying our prescription for optimal codes is a new variational formula for integer moments of random variables, which may be of independent interest. Also, we discuss possible extensions of our formulation to randomized schemes and to the erasure channel, and include a treatment of the related problem of source coding for minimum average queuing delay. © 1963-2012 IEEE.

Item Type:	Journal Article
Publication:	IEEE Transactions on Information Theory
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	Copy right for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords:	Random variables, Erasure channels; Identically distributed random variables; Integer-moment; Optimal codes; Optimization problems; Queuing delay; Source codes; Source-coding, Transmitters
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	10 Nov 2020 06:33
Last Modified:	10 Nov 2020 06:33
URI:	http://eprints.iisc.ac.in/id/eprint/65713

Actions (login required)

View Item