论文标题
与Hybrid CSIT一起使用Cache Aded Miso广播频道的费用 - 内存权衡
Rate-Memory Trade-Off for the Cache-Aided MISO Broadcast Channel with Hybrid CSIT
论文作者
论文摘要
通信中著名的问题之一是广播频道中所谓的“ PN”问题，该问题是指固定用户为多Ant-Antenna发射器提供完美的频道状态信息（CSI）的设置，而其余用户仅提供有限的PRECISION CSI或不提供CSI或不提供CSI。该设置的自由度（DOF）最近通过对齐图像集方法得出。在这项工作中，我们解决了此问题的高速缓存变体（即带有侧面信息的“ PN”设置），在该制度中，提供完美CSI的用户数量较小或等于发送天线的数量。特别是，我们在未经编码的放置的假设下得出了最佳的速率 - 记忆权衡权衡，并将同一权衡的特征在2.01倍以内用于一般放置。结果证明，即使存在附带信息，“ PN”影响仍然相似，而且通过独立服务两组用户，最佳权衡是无法实现的。
One of the famous problems in communications was the so-called "PN" problem in the Broadcast Channel, which refers to the setting where a fixed set of users provide perfect Channel State Information (CSI) to a multi-antenna transmitter, whereas the remaining users only provide finite-precision CSI or no CSI. The Degrees-of-Freedom (DoF) of that setting were recently derived by means of the Aligned Image Set approach. In this work, we resolve the cache-aided variant of this problem (i.e., the "PN" setting with side information) in the regime where the number of users providing perfect CSI is smaller or equal to the number of transmit antennas. In particular, we derive the optimal rate-memory trade-off under the assumption of uncoded placement and characterize the same trade-off within a factor of 2.01 for general placement. The result proves that the "PN" impact remains similar even in the presence of side information, but also that the optimal trade-off is not achievable through independently serving the two sets of users.
