deposit_your_work

Lower Bounds on the Capacity of Gaussian Relay Channel

Files in this item

Files Size Format View
Kho2004Mar5LowerBound.PDF 131.5Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Lower Bounds on the Capacity of Gaussian Relay Channel
Author: Khojastepour, Mohammad; Sabharwal, Ashutosh; Aazhang, Behnaam
Type: Conference Paper
Keywords: relay channel; capacity; achievable rate
Citation: M. Khojastepour, A. Sabharwal and B. Aazhang,"Lower Bounds on the Capacity of Gaussian Relay Channel," in Conference on Information Sciences and Systems,
Abstract: It has been shown recently that the overall throughput of dense wireless networks can increase significantly when wireless nodes collaborate in transmission of different packets. In this paper, we focus on a simple network known as the relay channel, where there is a single relaying node in the system assisting a sender-receiver pair. We present a new achievable rate for the case of Gaussian relay channels, which outperforms the best known schemes in many cases of interest. The proposed scheme is a variation of the amplify and forward method, and is labelled as a scale and forward scheme, signifying that the relay does not use all its power amplifying the received signal. By controlling the scaling and time-correlation of the relay signal, we show that the proposed scheme can outperform all known schemes for several channel gains, especially those where the best known methods provide no improvement over direct transmission. Numerical results are presented to quantify in which regimes the proposed scheme is the best known coding scheme for the Gaussian relay channel.
Date Published: 2004-03-01

This item appears in the following Collection(s)

  • ECE Publications [1032 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students