arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1904.02076cs.NI
收藏

轻量级FEC:具有最小反馈信息的矩形码

Lightweight FEC: Rectangular Codes with Minimum Feedback Information

Binh-Minh Bui-Xuan, Pierre Meyer, Antoine Roux

摘要:

我们提出了一种混合协议相结合的矩形纠错码-配对的错误检测码-和一个后向纠错,以便在嘈杂的信道上发送信息包。我们描述了一个线性时间算法,接收器可以使用它来确定要从发送器请求的最小信息量,以便修复所有的传输错误。修复可能会发生在几个周期的排放和请求。我们表明,我们的协议的预期带宽使用上的反向信道是渐近小。在大多数配置中,我们给出了所述期望的显式渐近展开。这是通过将我们的问题链接到小工具图上的一个众所周知的算法问题,反馈边集来获得的。反向信道的少量使用使得我们的协议适用于可以简单地使用反向纠错的情况,例如TCP,但是过度使用反向信道是不可取的。我们面对我们的协议,数值分析与TCP协议。在大多数情况下,我们的协议允许将迭代次数减少到60%,同时只需要微不足道的更多包。

英文摘要:

We propose a hybrid protocol combining a rectangular error-correcting code - paired with an error-detecting code - and a backward error correction in order to send packages of information over a noisy channel. We depict a linear-time algorithm the receiver can use to determine the minimum amount of information to be requested from the sender in order to repair all transmission errors. Repairs may possibly occur over several cycles of emissions and requests. We show that the expected bandwidth use on the backward channel by our protocol is asymptotically small. In most configurations we give the explicit asymptotic expansion for said expectation. This is obtained by linking our problem to a well known algorithmic problem on a gadget graph, feedback edge set. The little use of the backward channel makes our protocol suitable where one could otherwise simply use backward error correction, e.g. TCP, but where overly using the backward channel is undesirable. We confront our protocol to numerical analysis versus TCP protocol. In most cases our protocol allows to reduce the number of iterations down to 60%, while requiring only negligibly more packages.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑