Sequentially Mixing Randomly Arriving Packets Improves Channel Dispersion Over Block-Based Designs

Pin Wen Su, Yu Chih Huang, Shih Chun Lin, I. Hsiang Wang, Chih Chun Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Channel dispersion quantifies the convergence speed of coding rate to channel capacity under different latency constraints. Under the setting of packet erasure channels (PECs) with Bernoulli packet arrivals, this work characterizes the channel dispersions of random linear streaming codes (RLSCs) and MDS block codes, respectively. New techniques are developed to quantify the channel dispersion of sequential (non-block-based) coding, the first in the literature. The channel dispersion expressions are then used to compare the levels of error protection between RLSCs and MDS block codes. The results show that if and only if the target error probability pe is smaller than a threshold (≈0.1774), RLSCs offer strictly stronger error protection than MDS block codes, which is on top of the already significant 50% latency savings of RLSCs that eliminate the queueing delay completely.

Original languageEnglish
Title of host publication2022 IEEE International Symposium on Information Theory, ISIT 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2321-2326
Number of pages6
ISBN (Electronic)9781665421591
DOIs
StatePublished - 2022
Event2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finland
Duration: 26 Jun 20221 Jul 2022

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2022-June
ISSN (Print)2157-8095

Conference

Conference2022 IEEE International Symposium on Information Theory, ISIT 2022
Country/TerritoryFinland
CityEspoo
Period26/06/221/07/22

Fingerprint

Dive into the research topics of 'Sequentially Mixing Randomly Arriving Packets Improves Channel Dispersion Over Block-Based Designs'. Together they form a unique fingerprint.

Cite this