Simple Streaming Codes for Reliable, Low-Latency Communication
Simple Streaming Codes for Reliable, Low-Latency Communication
复制标题
简单的流代码可实现可靠、低延迟的通信
DOI：
10.1109/lcomm.2019.2956500
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
P. Vijay Kumar
中科院分区：
文献类型：
--
作者：
M. Nikhil Krishnan;Vinayak Ramkumar;Myna Vajha;P. Vijay Kumar
流编码提供可靠的恢复下解码延迟约束<inline-formula><tex-math notation="LaTeX">$\tau $</tex-math></inline-formula>，通过突发和随机擦除信道传输的数据包。先前的速率最优码构造具有在<inline-formula><tex-math notation="LaTeX">$\tau $</tex-math></inline-formula>中二次的字段大小，并且在分组流内采用长度<inline-formula><tex-math notation="LaTeX">为$n$</tex-math></inline-formula>的标量块码的对角嵌入。它示出在这里，交错对角线嵌入（ESTA）下的<inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>码符号分散在一个跨度的<inline-formula><tex-math notation="LaTeX">$N \GE N$</tex-math></inline-formula>连续的数据包导致一个更简单的，低复杂度的建设具有线性字段大小的速率最优流码。<inline-formula><tex-math notation="LaTeX">在$N \leq \tau +1 $</tex-math></inline-formula>的限制下，探讨了该方法的局限性。一些二进制流编码，在此限制下的速率最优的确定。
Streaming codes offer reliable recovery under decoding-delay constraint <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>, of packets transmitted over a burst-and-random-erasure channel. Prior rate-optimal code constructions had field size quadratic in <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula> and employed diagonal embedding of a scalar block code of length <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> within the packet stream. It is shown here that staggered diagonal embedding (SDE) under which the <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> code symbols are dispersed across a span of <inline-formula> <tex-math notation="LaTeX">$N \ge n$ </tex-math></inline-formula> successive packets leads to a simpler, low-complexity construction of rate-optimal streaming codes having linear field size. The limits of the SDE approach under the restriction <inline-formula> <tex-math notation="LaTeX">$N \leq \tau +1$ </tex-math></inline-formula> are explored. Some binary streaming codes that are rate-optimal under this restriction are identified.