有限回程上行链路多小区处理中计算转发的有损压缩
Lossy Compression for Compute-and-Forward in Limited Backhaul Uplink Multicell Processing
摘要：
我们研究了通过云无线接入网络的传输，其中多个基站（BS）通过有限容量的回程链路连接到中央处理器（CP）。我们提出了两个基于格的编码方案。在第一种方案中，基站按照计算并转发（CoF）的精神对所发送消息的线性组合进行解码，但与之本质上的不同之处在于，解码的方程被重新映射到信道输入符号的线性组合，以有损方式压缩发送到中央处理器，并且不要求是线性独立的。此外，与标准CoF相反，利用适当的多用户解码器来恢复发送的消息。第二编码方案通过还允许在每个中继节点处对解码的等式和接收到的信号进行联合压缩来推广第一编码方案。这两种方案一般都适用，但更适合于用户多于基站的情况。我们表明，这两个计划可以优于标准的CoF和连续的Wyner-Ziv计划在某些制度，并说明通过一些数值例子的收益。
英文摘要：
We study the transmission over a cloud radio access network in which multiple base stations (BS) are connected to a central processor (CP) via finite-capacity backhaul links. We propose two lattice-based coding schemes. In the first scheme, the base stations decode linear combinations of the transmitted messages, in the spirit of compute-and-forward (CoF), but differs from it essentially in that the decoded equations are remapped to linear combinations of the channel input symbols, sent compressed in a lossy manner to the central processor, and are not required to be linearly independent. Also, by opposition to the standard CoF, an appropriate multi-user decoder is utilized to recover the sent messages. The second coding scheme generalizes the first one by also allowing, at each relay node, a joint compression of the decoded equation and the received signal. Both schemes apply in general, but are more suited for situations in which there are more users than base stations. We show that both schemes can outperform standard CoF and successive Wyner-Ziv schemes in certain regimes, and illustrate the gains through some numerical examples.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
