Resource Allocation in Multiple Access Channels

Details Resource Allocation in Multiple Access Channels Resource Allocation in Multiple Access Channels

2008-10-07

arxiv.org/abs/0810.1248v1

Computer Science

Information Theory

5 pages, In proc. of ACSSC 2007

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Resource Allocation in Multiple Access Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Resource Allocation in Multiple Access Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Resource Allocation in Multiple Access Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558017