Resource Allocation in Multiple Access Channels
| dc.creator | ParandehGheibi, Ali | |
| dc.creator | Eryilmaz, Atilla | |
| dc.creator | Ozdaglar, Asuman | |
| dc.creator | Medard, Muriel | |
| dc.date | 2008-10-07 | |
| dc.date.accessioned | 2026-07-07T10:08:09Z | |
| dc.date.available | 2026-07-07T10:08:09Z | |
| dc.description | 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. | |
| dc.description | 5 pages, In proc. of ACSSC 2007 | |
| dc.identifier | https://arxiv.org/abs/0810.1248 | |
| dc.identifier | http://arxiv.org/abs/0810.1248 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170898 | |
| dc.subject | Information Theory | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | Optimization and Control | |
| dc.title | Resource Allocation in Multiple Access Channels | |
| dc.type | text |