TY - GEN
T1 - Sequential coding of Gauss-Markov sources with packet erasures and feedback
AU - Khina, Anatoly
AU - Kostina, Victoria
AU - Khisti, Ashish
AU - Hassibi, Babak
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - 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 decoder - 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.
AB - 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 decoder - 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.
UR - http://www.scopus.com/inward/record.url?scp=85046348688&partnerID=8YFLogxK
U2 - 10.1109/ITW.2017.8277955
DO - 10.1109/ITW.2017.8277955
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85046348688
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 529
EP - 530
BT - 2017 IEEE Information Theory Workshop, ITW 2017
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE Information Theory Workshop, ITW 2017
Y2 - 6 November 2017 through 10 November 2017
ER -