Optimal Multiplexed Erasure Codes for Streaming Messages With Different Decoding Delays
| Autor: | Ashish Khisti, Silas L. Fong, Wai-Tian Tan, Xiaoqing Zhu, John G. Apostolopoulos, Baochun Li |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Current (mathematics) Computer science Computer Science - Information Theory Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Library and Information Sciences Multiplexing Channel (programming) Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering Code (cryptography) Forward error correction Computer Science::Information Theory Physics Discrete mathematics Sequence Network packet Information Theory (cs.IT) Packet erasure channel 020206 networking & telecommunications Computer Science Applications Erasure Erasure code Algorithm Decoding methods Communication channel Information Systems |
| Zdroj: | ISIT |
| ISSN: | 1557-9654 0018-9448 |
| Popis: | This paper considers multiplexing two sequences of messages with two different decoding delays over a packet erasure channel. In each time slot, the source constructs a packet based on the current and previous messages and transmits the packet, which may be erased when the packet travels from the source to the destination. The destination must perfectly recover every source message in the first sequence subject to a decoding delay $T_\mathrm{v}$ and every source message in the second sequence subject to a shorter decoding delay $T_\mathrm{u}\le T_\mathrm{v}$. We assume that the channel loss model introduces a burst erasure of a fixed length $B$ on the discrete timeline. Under this channel loss assumption, the capacity region for the case where $T_\mathrm{v}\le T_\mathrm{u}+B$ was previously solved. In this paper, we fully characterize the capacity region for the remaining case $T_\mathrm{v}> T_\mathrm{u}+B$. The key step in the achievability proof is achieving the non-trivial corner point of the capacity region through using a multiplexed streaming code constructed by superimposing two single-stream codes. The main idea in the converse proof is obtaining a genie-aided bound when the channel is subject to a periodic erasure pattern where each period consists of a length-$B$ burst erasure followed by a length-$T_\mathrm{u}$ noiseless duration. 20 pages, 1 figure, 1 table, presented in part at 2019 IEEE ISIT |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|