On the Role of Encoder Side-Information in Source Coding for Multiple Decoders

Perron, Etienne; Diggavi, Suhas; Telatar, I.E.

doi:10.1109/isit.2006.261608

Cited by 14 publications

(16 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…IX, by discussing the cases of large delays, other types of VLC compression, and single-track with fixed-length coding (FLC) compression. 1 The scenario considered in [31], [32] can be also viewed as special case of the results of Heegard and Berger [33], where the SI is not available at the observer, by adjusting the distortion measure and "augmenting" the state [34]. Interestingly, knowing the SI at the observer allows one to improve the optimal performance of this scenario in the Gaussian case; see Rem.…”

mentioning

confidence: 99%

Tracking and Control of Gauss–Markov Processes over Packet-Drop Channels with Acknowledgments

Khina

Kostina

Khisti

et al. 2019

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

We consider the problem of tracking the state of Gauss-Markov processes over rate-limited erasureprone links. We concentrate first on the scenario in which several independent processes are seen by a single observer. The observer maps the processes into finite-rate packets that are sent over the erasureprone links to a state estimator, and are acknowledged upon packet arrivals. The aim of the state estimator is to track the processes with zero delay and with minimum mean square error (MMSE). We show that, in the limit of many processes, greedy quantization with respect to the squared error distortion is optimal.That is, there is no tension between optimizing the MMSE of the process in the current time instant and that of future times. For the case of packet erasures with delayed acknowledgments, we connect the problem to that of compression with side information that is known at the observer and may be known at the state estimator -where the most recent packets serve as side information that may have been erased, and demonstrate that the loss due to a delay by one time unit is rather small. For the scenario where only one process is tracked by the observer-state estimator system, we further show that variable-length coding This work was done, in part, while A. Khina and V. Kostina were visiting the Simons Institute for the Theory of Computing.techniques are within a small gap of the many-process outer bound. We demonstrate the usefulness of the proposed approach for the simple setting of discrete-time scalar linear quadratic Gaussian control with a limited data-rate feedback that is susceptible to packet erasures. Index TermsState tracking, state estimation, networked control, packet erasures, source coding with side information, sequential coding of correlated sources, successive refinement. I. INTRODUCTIONTracking the state of a system from noisy and possibly partially observable measurements is of prime importance in many estimation scenarios, and serves as an important building block in many control setups.The recent rapid growth in wireless connectivity and its ad hoc distributed nature, while offering a plethora of new and exciting possibilities, introduces new design challenges for control over such media.These challenges include, among others, the need to track processes with minimal error over digital links of limited data rate which could be prone to (packet) erasures, and joint processing and reconstruction of distributed processes.An important scenario, often encountered in practice, depicted in Fig. 1, is that of a multi-track system that tracks several processes over a single shared communication link. In this scenario, at each time instant, several processes are observed by a single observer. The observer, in turn, collects the measured states of these processes into a single vector state or frame, and maps them into finite-rate packets, which are sent to the state-estimator over a channel which is prone to packet erasures. The state estimator tracks the latest states of the different processes, by...

show abstract

mentioning

confidence: 99%

Tracking and Control of Gauss–Markov Processes over Packet-Drop Channels with Acknowledgments

Khina

Kostina

Khisti

et al. 2019

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

show abstract

“…To that end, we recall the following result by Perron et al [15,Th. 2], which is a specialization to the jointly Gaussian Remark 8.…”

Section: Packet Erasures With Delayed Feedbackmentioning

confidence: 88%

“…Surprisingly, as observed by Perron et al [15], if the side-information signal y is not available at the encodercorresponding to the case considered in [16] and [14, Th. 2] -the required rate can be strictly higher than that in Th.…”

Section: Theorem 3 ( [15])mentioning

confidence: 96%

“…Viewing these recent packets as side information (SI) that is available at the encoder and possibly at the decoder, and leveraging the results of Kaspi [14] along with their specialization for the Gaussian case by Perron et al [15], 1 we adapt our transmission scheme to the case of delayed feedback. We provide a detailed description of the proposed scheme for the case where the feedback is delayed by one time unit and demonstrate that the loss compared to the case of instantaneous feedback is small.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Sequential coding of Gauss-Markov sources with packet erasures and feedback

Khina

Kostina

Khisti

et al. 2017

2017 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

Abstract-We consider the problem of sequential transmission of Gauss-Markov sources. We show that in the limit of large spatial block lengths, greedy compression with respect to the squared error distortion is optimal; that is, there is no tension between optimizing the distortion of the source in the current time instant and that of future times. We then extend this result to the case where at time t a random compression rate Rt is allocated independently of the rate at other time instants. This, in turn, allows us to derive the optimal performance of sequential coding over packet-erasure channels with instantaneous feedback. For the case of packet erasures with delayed feedback, we connect the problem to that of compression with side information that is known at the encoder and may be known at the decoderwhere the most recent packets serve as side information that may have been erased. We conclude the paper by demonstrating that the loss due to a delay by one time unit is rather small.

show abstract

“…As Decoders 1 and 2 recover v } and v� , respectively, the system can be treated as a special case of the Kaspi/Heegard Berger problem with an informed encoder and then the achiev ability follows from [11] (see also [12]). …”

Section: The Two-user Casementioning

confidence: 99%

Information-theoretic caching

Wang

Lim

Gastpar

2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

Motivated by the caching problem introduced byMaddah-Ali and Niesen, a problem of distributed source coding with side information is formulated, which captures a distinct interesting aspect of caching. For the single-user case, a single letter characterization of the optimal rate region is presented. For the cases where the source is composed of either independent or nested components, the exact optimal rate regions are foun� and some intuitive caching strategies are confirmed to be optImal.When the components are arbitrarily correlated with uniform requests, the optimal caching strategy is found to be closely related to total correlation and Wyner's common information.For the two-user case, some subproblems are solved which draw connections to the Gray-Wyner system and distributed successive refinement. Finally, inner and outer bounds are given for the case of two private caches with a common update.

show abstract

On the Role of Encoder Side-Information in Source Coding for Multiple Decoders

Cited by 14 publications

References 7 publications

Tracking and Control of Gauss–Markov Processes over Packet-Drop Channels with Acknowledgments

Tracking and Control of Gauss–Markov Processes over Packet-Drop Channels with Acknowledgments

Sequential coding of Gauss-Markov sources with packet erasures and feedback

Information-theoretic caching

Contact Info

Product

Resources

About