Sequentially Mixing Randomly Arriving Packets Improves Channel Dispersion Over Block-Based Designs
Sequentially Mixing Randomly Arriving Packets Improves Channel Dispersion Over Block-Based Designs
复制标题
DOI：
10.1109/isit50566.2022.9834408
复制
发表时间：
2022-06
期刊：
影响因子：
--
通讯作者：
Pin-Wen Su;Yu-Chih Huang;Shih-Chun Lin;I-Hsiang Wang;Chih-Chun Wang
中科院分区：
文献类型：
--
作者：
Pin-Wen Su;Yu-Chih Huang;Shih-Chun Lin;I-Hsiang Wang;Chih-Chun Wang
信道色散量化了在不同时延约束下编码速率对信道容量的收敛速度。在具有伯努利数据包到达的分组擦除信道（PECs）设置下，本研究分别表征了随机线性流码（RLSCs）和MDS分组码的信道色散。新技术的开发，以量化顺序（非基于块）编码的信道色散，第一次在文献中。然后使用信道色散表达式来比较RLSCs和MDS分组码之间的错误保护水平。结果表明，当且仅当目标错误概率pe小于阈值（≈0.1774）时，RLSCs比MDS分组码提供严格更强的错误保护，这是在RLSCs完全消除队列延迟的50%延迟节省的基础上实现的。
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.