A New Achievable Rate for the Gaussian Parallel Relay Channel

Details A New Achievable Rate for the Gaussian Parallel Relay Channel A New Achievable Rate for the Gaussian Parallel Relay Channel

2009-02-10

arxiv.org/abs/0902.1734v1

Computer Science

Information Theory

22 pages, 9 figures, Submitted to Transaction on Information Theory

Scientific paper

Schein and Gallager introduced the Gaussian parallel relay channel in 2000. They proposed the Amplify-and-Forward (AF) and the Decode-and-Forward (DF) strategies for this channel. For a long time, the best known achievable rate for this channel was based on the AF and DF with time sharing (AF-DF). Recently, a Rematch-and-Forward (RF) scheme for the scenario in which different amounts of bandwidth can be assigned to the first and second hops were proposed. In this paper, we propose a \emph{Combined Amplify-and-Decode Forward (CADF)} scheme for the Gaussian parallel relay channel. We prove that the CADF scheme always gives a better achievable rate compared to the RF scheme, when there is a bandwidth mismatch between the first hop and the second hop. Furthermore, for the equal bandwidth case (Schein's setup), we show that the time sharing between the CADF and the DF schemes (CADF-DF) leads to a better achievable rate compared to the time sharing between the RF and the DF schemes (RF-DF) as well as the AF-DF.

Affiliated with

Also associated with

No associations

Rating

A New Achievable Rate for the Gaussian Parallel Relay Channel 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 A New Achievable Rate for the Gaussian Parallel Relay Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Achievable Rate for the Gaussian Parallel Relay Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486721