论文标题
功率分配的注释，以实现最佳能力
A note on power allocation for optimal capacity
论文作者
论文摘要
确定最大功率范围内确定最佳功率分配的问题，以（i）最大化最小的香农容量，以及（ii）最大程度地减少加权潜伏期。在第一种情况下，可以通过求解一系列线性程序（LP）来在多项式时间内实现全局最佳。在第二种情况下，使用功能近似，原始的非凸问题被凸替代（几何程序）取代。由于近似误差相对较低，因此替代物的最优值接近原始问题的全局最佳点。在任何一种情况下，都不是在SINR范围内的假设。 LPS和几何编程的使用使所提出的算法在数值上有效。提供了佐证的计算。
The problems of determining the optimal power allocation, within maximum power bounds, to (i) maximize the minimum Shannon capacity, and (ii) minimize the weighted latency are considered. In the first case, the global optima can be achieved in polynomial time by solving a sequence of linear programs (LP). In the second case, the original non-convex problem is replaced by a convex surrogate (a geometric program), using a functional approximation. Since the approximation error is relatively low, the optima of the surrogate is close to the global optimal point of the original problem. In either cases, there is no assumption on the SINR range. The use of LPs and geometric programming make the proposed algorithms numerically efficient. Computations are provided for corroboration.
