Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels

DOI10.1109/TIT.2014.2326661zbMATH Open1360.94014arXiv1410.2326OpenAlexW2962777761MaRDI QIDQ2986209FDOQ2986209

Authors: Farrokh Etezadi, Ashish Khisti, Mitchell D. Trott 

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: A setup involving zero-delay sequential transmission of a vector Markov source over a burst erasure channel is studied. A sequence of source vectors is compressed in a causal fashion at the encoder, and the resulting output is transmitted over a burst erasure channel. The destination is required to reconstruct each source vector with zero-delay, but those source sequences that are observed either during the burst erasure, or in the interval of length $W$ following the burst erasure need not be reconstructed. The minimum achievable compression rate is called the rate-recovery function. We assume that each source vector is sampled i.i.d. across the spatial dimension and from a stationary, first-order Markov process across the temporal dimension. For discrete sources the case of lossless recovery is considered, and upper and lower bounds on the rate-recovery function are established. Both these bounds can be expressed as the rate for predictive coding, plus a term that decreases at least inversely with the recovery window length $W$. For Gauss-Markov sources and a quadratic distortion measure, upper and lower bounds on the minimum rate are established when $W=0$. These bounds are shown to coincide in the high resolution limit. Finally another setup involving i.i.d. Gaussian sources is studied and the rate-recovery function is completely characterized in this case.

Full work available at URL: https://arxiv.org/abs/1410.2326

Recommendations

• On Optimal Zero-Delay Coding of Vector Markov Sources
• Optimal Zero Delay Coding of Markov Sources: Stationary and Finite Memory Codes
• Delay on Broadcast Erasure Channels Under Random Linear Combinations
• On Zero-Delay Source-Channel Coding
• scientific article; zbMATH DE number 3412514
• Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes
• Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures
• Delay Asymptotics With Retransmissions and Incremental Redundancy Codes Over Erasure Channels
• Capacity-achieving sequences for the erasure channel
• Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures

Mathematics Subject Classification ID

Communication theory (94A05)

This page was built for publication: Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986209)