arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.1248cs.ITcs.NImath.ITmath.OC
收藏

多址接入信道中的资源分配

Resource Allocation in Multiple Access Channels

Ali ParandehGheibi, Atilla Eryilmaz, Asuman Ozdaglar, Muriel Medard

摘要:

我们考虑高斯多址信道中的速率分配问题,其目标是最大化传输速率上的效用函数。与文献中的线性效用函数不同,本文研究了一般的凹效用函数。我们提出了一个梯度投影算法解决这个问题。由于问题的约束集是由指数级的约束描述的,因此使用精确投影的方法在计算上是难以处理的。因此,我们开发了一种使用近似投影的新方法。我们使用的容量区域的多拟阵结构,表明近似投影可以实现的递归算法在时间多项式的用户数。我们进一步提出了另一种算法,用于实现近似投影使用率分裂,并显示其收敛时间的改进界限。

英文摘要:

We consider the problem of rate allocation in a Gaussian multiple-access channel, with the goal of maximizing a utility function over transmission rates. In contrast to the literature which focuses on linear utility functions, we study general concave utility functions. We present a gradient projection algorithm for this problem. Since the constraint set of the problem is described by exponentially many constraints, methods that use exact projections are computationally intractable. Therefore, we develop a new method that uses approximate projections. We use the polymatroid structure of the capacity region to show that the approximate projection can be implemented by a recursive algorithm in time polynomial in the number of users. We further propose another algorithm for implementing the approximate projections using rate-splitting and show improved bounds on its convergence time.

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

↑