arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.10901cs.ITeess.SPmath.IT
收藏

多址和广播信道间的压缩中继上下行对偶

Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels with Compressing Relays

Liang Liu, Ya-Feng Liu, Pratik Patil, Wei Yu

摘要:

上行链路-下行链路对偶性是指在和功率约束下,具有厄米转置信道矩阵的高斯多址信道和高斯广播信道的容量区域是相同的。本文将这一结果推广到一个合作的蜂窝网络中,在该网络中,远程接入点被部署为中继,在中央处理器(CP)的协调下为用户提供服务。在该模型中,用户和中继通过有噪声的无线链路连接,而中继和CP通过无噪声但速率受限的前传链路连接。基于拉格朗日技术,本文建立了这样的多址中继信道和广播中继信道之间的对偶关系,假设中继使用基于压缩的策略。具体而言,我们表明,在相同的总发射功率约束和个人前传速率约束下,高斯多址接入和广播中继信道的可实现速率区域是相同的,当使用独立压缩或Wyner-Ziv和多变量压缩策略。关键的观察结果是,如果在中继器处的波束成形向量是固定的,则在上行链路和下行链路两者中的可实现速率和前传约束下的和功率最小化问题可以根据压缩技术被变换成线性规划或半定规划问题,并且上行链路和下行链路问题是彼此的拉格朗日方程。此外,对应于下行链路速率约束的对偶变量成为上行链路功率;对应于下行链路前传约束的对偶变量成为上行链路量化噪声。这种对偶关系使得能够实现用于基于上行链路优化下行链路传输和中继策略的有效算法。

英文摘要:

Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper generalizes this result to a cooperative cellular network, in which remote access-points are deployed as relays in serving the users under the coordination of a central processor (CP). In this model, the users and the relays are connected over noisy wireless links, while the relays and the CP are connected over noiseless but rate-limited fronthaul links. Based on a Lagrangian technique, this paper establishes a duality relationship between such a multiple-access relay channel and broadcast relay channel, under the assumption that the relays use compression-based strategies. Specifically, we show that under the same total transmit power constraint and individual fronthaul rate constraints, the achievable rate regions of the Gaussian multiple-access and broadcast relay channels are identical, when either independent compression or Wyner-Ziv and multivariate compression strategies are used. The key observations are that if the beamforming vectors at the relays are fixed, the sum-power minimization problems under the achievable rate and fronthaul constraints in both the uplink and the downlink can be transformed into either a linear programming or a semidefinite programming problem depending on the compression technique, and that the uplink and downlink problems are Lagrangian duals of each other. Moreover, the dual variables corresponding to the downlink rate constraints become the uplink powers; the dual variables corresponding to the downlink fronthaul constraints become the uplink quantization noises. This duality relationship enables an efficient algorithm for optimizing the downlink transmission and relaying strategies based on the uplink.

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

↑