Computer Science – Information Theory
Scientific paper
2011-08-14
Computer Science
Information Theory
19 pages, 2 figures
Scientific paper
In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on its current received symbol, which is an appropriate model for studying amplify-and-forward type relaying when the overall delay spread is much smaller than the inverse of the bandwidth. For the discrete memoryless interference relay-without-delay channel, we show an outer bound using genie-aided outer bounding. For the Gaussian interference relay-without-delay channel, we define strong and very strong interference relay-without-delay channels and propose an achievable scheme based on instantaneous amplify-and-forward (AF) relaying. We also propose two outer bounds for the strong and very strong cases. Using the proposed achievable scheme and outer bounds, we show that our scheme can achieve the capacity exactly when the relay's transmit power is greater than a certain threshold. This is surprising since the conventional AF relaying is usually only asymptotically optimal, not exactly optimal. The proposed scheme can be useful in many practical scenarios due to its optimality as well as its simplicity.
Chang Hyunseok
Chung Sae-Young
No associations
LandOfFree
Capacity of Strong and Very Strong Gaussian Interference Relay-without-delay 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 Capacity of Strong and Very Strong Gaussian Interference Relay-without-delay Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity of Strong and Very Strong Gaussian Interference Relay-without-delay Channels will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-711884