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

Anatoly Khina; Victoria Kostina; Ashish Khisti; Babak Hassibi

doi:10.1109/ITW.2017.8277955

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

Anatoly Khina, Victoria Kostina, Ashish Khisti, Babak Hassibi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

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 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.

Original language	English (US)
Title of host publication	2017 IEEE Information Theory Workshop (ITW)
Publisher	IEEE
Pages	529-530
Number of pages	2
ISBN (Print)	9781509030972
DOIs	https://doi.org/10.1109/ITW.2017.8277955
State	Published - Feb 1 2018
Externally published	Yes

Bibliographical note

KAUST Repository Item: Exported on 2022-06-28
Acknowledgements: The work of A. Khina has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 708932. The work of V. Kostina was supported in part by the National Science Foundation under Grant CCF-1566567. Ashish Khisti was supported by the Canada Research Chairs Program. The work of B. Hassibi was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASA’s Jet Propulsion Laboratory through the President and Director’s Fund, by King Abdulaziz University, and by King Abdullah University of Science and Technology.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.

Access to Document

10.1109/ITW.2017.8277955

Cite this

@inproceedings{b3264851b5a84a32a1101692b8e15407,

title = "Sequential coding of Gauss-Markov sources with packet erasures and feedback",

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 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.",

author = "Anatoly Khina and Victoria Kostina and Ashish Khisti and Babak Hassibi",

note = "KAUST Repository Item: Exported on 2022-06-28 Acknowledgements: The work of A. Khina has received funding from the European Union{\textquoteright}s Horizon 2020 research and innovation programme under the Marie Sk{\l}odowska-Curie grant agreement No 708932. The work of V. Kostina was supported in part by the National Science Foundation under Grant CCF-1566567. Ashish Khisti was supported by the Canada Research Chairs Program. The work of B. Hassibi was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASA{\textquoteright}s Jet Propulsion Laboratory through the President and Director{\textquoteright}s Fund, by King Abdulaziz University, and by King Abdullah University of Science and Technology. This publication acknowledges KAUST support, but has no KAUST affiliated authors.",

year = "2018",

month = feb,

day = "1",

doi = "10.1109/ITW.2017.8277955",

language = "English (US)",

isbn = "9781509030972",

pages = "529--530",

booktitle = "2017 IEEE Information Theory Workshop (ITW)",

publisher = "IEEE",

}

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 - KAUST Repository Item: Exported on 2022-06-28 Acknowledgements: The work of A. Khina has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 708932. The work of V. Kostina was supported in part by the National Science Foundation under Grant CCF-1566567. Ashish Khisti was supported by the Canada Research Chairs Program. The work of B. Hassibi was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASA’s Jet Propulsion Laboratory through the President and Director’s Fund, by King Abdulaziz University, and by King Abdullah University of Science and Technology. This publication acknowledges KAUST support, but has no KAUST affiliated authors.

PY - 2018/2/1

Y1 - 2018/2/1

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://hdl.handle.net/10754/679396

UR - http://ieeexplore.ieee.org/document/8277955/

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 - Conference contribution

SN - 9781509030972

SP - 529

EP - 530

BT - 2017 IEEE Information Theory Workshop (ITW)

PB - IEEE

ER -

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

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this