On the sum-capacity of degraded Gaussian multiple-access relay channels

Authors:
Lalitha Sankar;Narayan B. Mandayam;H. Vincent Poor
Affiliations:
Department of Electrical Engineering, Princeton University, Princeton, NJ;WINLAB, Rutgers University, Technology Center of NJ, North Brunswick, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 13
Cited 0

Feedback can at most double gaussian multiple access channel capacity

IEEE Transactions on Information Theory
Elements of information theory

Elements of information theory
An introduction to signal detection and estimation (2nd ed.)

An introduction to signal detection and estimation (2nd ed.)
Information Theory and Reliable Communication

Information Theory and Reliable Communication
Convex Optimization

Convex Optimization
Multiaccess fading channels. I. Polymatroid structure, optimal resource allocation and throughput capacities

IEEE Transactions on Information Theory
Degraded Gaussian multirelay channel: capacity and optimal power allocation

IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel

IEEE Transactions on Information Theory
Capacity of a class of relay channels with orthogonal components

IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks

IEEE Transactions on Information Theory
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution

IEEE Transactions on Information Theory
Offset Encoding for Multiple-Access Relay Channels

IEEE Transactions on Information Theory
The Capacity of a Relay Channel, Both With and Without Delay

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

The sum-capacity is studied for a K-user physically degraded Gaussian multiple-access relay channel (MARC). Decode-and-forward (DF) is shown to achieve the sum-capacity and capacity region for a subclass of degraded Gaussian MARCs in which the multiple-access link from the sources to the relay is the bottleneck link. For the remaining subclass, DF is shown to achieve the K-user sum-capacity when the sources are symmetric, i.e., they transmit with the same transmit power. The optimality of DF is conjectured for the case of asymmetric sources.