Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rate Maximization for Half-Duplex Multiple Access with Cooperating Transmitters

Published 7 Mar 2012 in cs.IT and math.IT | (1203.1588v2)

Abstract: We derive the optimal resource allocation of a practical half-duplex scheme for the Gaussian multiple access channel with transmitter cooperation (MAC-TC). Based on rate splitting and superposition coding, two users transmit information to a destination over 3 phases, such that the users partially exchange their information during the first 2 phases and cooperatively transmit to the destination during the last one. This scheme is near capacity-achieving when the inter-user links are stronger than each user-destination link; it also includes partial decode-forward relaying as a special case. We propose efficient algorithms to find the optimal resource allocation for maximizing either the individual or the sum rate and identify the corresponding optimal scheme for each channel configuration. For fixed phase durations, the power allocation problem is convex and can be solved analytically based on the KKT conditions. The optimal phase durations can then be obtained numerically using simple search methods. Results show that as the interuser link qualities increase, the optimal scheme moves from no cooperation to partial then to full cooperation, in which the users fully exchange their information and cooperatively send it to the destination. Therefore, in practical systems with strong inter-user links, simple decode-forward relaying at both users is rate-optimal.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.