Computer Science – Information Theory
Scientific paper
2008-01-08
Computer Science
Information Theory
35 pages, 14 figures, submitted to IEEE Trans. on Inf. Theory
Scientific paper
The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is obtained that outperforms previously known outer bounds. The sum capacity for a certain range of channel parameters is derived. For this range, it is proved that using Gaussian codebooks and treating interference as noise is optimal. It is shown that when Gaussian codebooks are used, the full Han-Kobayashi achievable rate region can be obtained by using the naive Han-Kobayashi achievable scheme over three frequency bands (equivalently, three subspaces). For the one-sided Gaussian IC, an alternative proof for the Sato's outer bound is presented. We derive the full Han-Kobayashi achievable rate region when Gaussian codebooks are utilized. For the mixed Gaussian IC, a new outer bound is obtained that outperforms previously known outer bounds. For this case, the sum capacity for the entire range of channel parameters is derived. It is proved that the full Han-Kobayashi achievable rate region using Gaussian codebooks is equivalent to that of the one-sided Gaussian IC for a particular range of channel parameters.
Khandani Amir K.
Motahari Abolfazl S.
No associations
LandOfFree
Capacity Bounds for the Gaussian Interference 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 Capacity Bounds for the Gaussian Interference Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Capacity Bounds for the Gaussian Interference Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-421789