arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.01031cs.ITmath.IT
收藏

虚拟化云信道解码中抗处理延迟的编码计算

Coded Computation Against Processing Delays for Virtualized Cloud-Based Channel Decoding

Malihe Aliasgari, Jörg Kliewer, Osvaldo Simeone

摘要:

研究了云无线电接入网络架构的上行链路,其中经由商用现成服务器上的网络功能虚拟化在云处进行解码。为了减轻该平台中离散解码器的影响,提出了一种新的编码策略,由此云在将接收到的帧分发给解码处理器之前通过线性码对接收到的帧进行重新编码。首先考虑单个帧的传输,并且通过假设用于上行链路通信的二进制对称信道来导出作为解码延迟的函数的所得到的帧不可用概率的上界。然后,分析扩展到考虑随机帧到达时间。在这种情况下,平均解码延迟和帧出错率之间的权衡研究了两种不同的排队策略,由此服务器分别执行每帧解码或连续解码。数值例子表明,边界是有用的工具,代码的设计和编码是有助于获得一个理想的解码延迟和可靠性之间的妥协。

英文摘要:

The uplink of a cloud radio access network architecture is studied in which decoding at the cloud takes place via network function virtualization on commercial off-the-shelf servers. In order to mitigate the impact of straggling decoders in this platform, a novel coding strategy is proposed, whereby the cloud re-encodes the received frames via a linear code before distributing them to the decoding processors. Transmission of a single frame is considered first, and upper bounds on the resulting frame unavailability probability as a function of the decoding latency are derived by assuming a binary symmetric channel for uplink communications. Then, the analysis is extended to account for random frame arrival times. In this case, the trade-off between average decoding latency and the frame error rate is studied for two different queuing policies, whereby the servers carry out per-frame decoding or continuous decoding, respectively. Numerical examples demonstrate that the bounds are useful tools for code design and that coding is instrumental in obtaining a desirable compromise between decoding latency and reliability.

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

↑