Capacity to within 3 bits for a class of Gaussian Interference Channels with a Cognitive Relay

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of a classical two-user interference channel in which the two independent messages are also non-causally known at a cognitive relay node. In this work a special class of IFC-CRs in which the sources do not create interference at the non-intended destinations is analyzed. This special model results in a channel with two non-interfering point-to-point channels whose transmission is aided by an in-band cognitive relay, which is thus referred to as the Parallel Channel with a Cognitive Relay (PC-CR). We determine the capacity of the PC-CR channel to within 3 bits/s/Hz for all channel parameters. In particular, we present several new outer bounds which we achieve to within a constant gap by proper selection of Gaussian input distributions in a simple rate-splitting and superposition coding-based inner bound. The inner and outer bounds are numerically evaluated to show that the actual gap can be far less than 3 bits/s/Hz.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Capacity to within 3 bits for a class of Gaussian Interference Channels with a Cognitive Relay 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 to within 3 bits for a class of Gaussian Interference Channels with a Cognitive Relay, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity to within 3 bits for a class of Gaussian Interference Channels with a Cognitive Relay will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-416640

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.