1 / 22

Gaussian Interference Channel Capacity to Within One Bit

Gaussian Interference Channel Capacity to Within One Bit. R. Etkin, D. Tse (Berkeley), Hua Wang (UIUC) EPFL Nov 14, 2006. TexPoint fonts used in EMF: A A A A A A A A A A A. Interference. Interference management is a central problem in wireless system design.

faris
Télécharger la présentation

Gaussian Interference Channel Capacity to Within One Bit

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Gaussian Interference Channel Capacity to Within One Bit R. Etkin, D. Tse (Berkeley), Hua Wang (UIUC) EPFL Nov 14, 2006 TexPoint fonts used in EMF: AAAAAAAAAAA

  2. Interference • Interference management is a central problem in wireless system design. • Within same system (eg. adjacent cells in a cellular system) or across different systems (eg. multiple WiFi networks) • Two basic approaches: • orthogonalize into different bands • full sharing of spectrum but treating interference as noise • What does information theory have to say about the optimalthing to do?

  3. Two-User Gaussian Interference Channel • Characterized by 4 parameters: • Signal-to-noise ratios SNR1, SNR2 at Rx 1 and 2. • Interference-to-noise ratios INR2->1, INR1->2 at Rx 1 and 2.

  4. Related Results • If receivers can cooperate, this is a multiple access channel. Capacity is known. (Ahlswede 71, Liao 72) • If transmitters can cooperate , this is a MIMO broadcast channel. Capacity recently found. (Weingarten et al 04) • When there is no cooperation of all, it’s the interference channel. Open problem for 30 years.

  5. State-of-the-Art • If INR1->2 > SNR1 and INR2->1 > SNR2, then capacity region Cint is known (strong interference, Han-Kobayashi 1981, Sato 81) • Capacity is unknown for any other parameter ranges. • Best known achievable region is due to Han-Kobayashi (1981). • Hard to compute explicitly. • Unclear if it is optimal or even how far from capacity. • Some outer bounds exist but unclear how tight (Sato 78, Costa 85, Kramer 04).

  6. Review: Strong Interference Capacity • INR1->2 > SNR1, INR2->1> SNR2 • Key idea: in any achievable scheme, each user must be able to decode the other user’s message. • Information sent from each transmitter must be common information, decodable by all. • The interference channel capacity region is the intersection of the two MAC regions, one at each receiver.

  7. Our Contribution • We show that a very simple Han-Kobayashi type scheme can achieve within 1 bit/s/Hz of capacity for all values of channel parameters: For any in Cint, this scheme can achieve with: • Proving this result requires new outer bounds. • In this talk we focus mainly on the symmetric capacity Csym and symmetric channels SNR1=SNR2, INR1->2=INR2->1

  8. Proposed Scheme for INR < SNR decode common then private decode common private then • Set private power so that it is received at the level of the noise at the other receiver (INRp = 0 dB).

  9. Why set INRp = 0 dB? • This is a sweet spot where the damage to the other link is small but can get a high rate in own link since SNR > INR.

  10. Main Result (SNR > INR) • The scheme achieves a symmetric rate per user: • The symmetric capacity is upper bounded by: • The gap is at most one bit for all values of SNR and INR.

  11. Interference-Limited Regime • At low SNR, links are noise-limited and interference plays little role. • At high SNR and high INR, links are interference-limited and interference plays a central role. • In this regime, capacity is unbounded and yet our scheme is always within 1 bit of capacity. • Interference-limited behavior is captured.

  12. Baselines • Point-to-point capacity: • Achievable rate by orthogonalizing: • Achievable rate by treating interference as noise: • Similar high SNR approximation to the capacity can be made using our bounds (error < 1 bit) .

  13. Performance plot

  14. Upper Bound: Z-Channel • Equivalently, x1 given to Rx 2 as side information.

  15. How Good is this Bound?

  16. What’s going on? Scheme has 2 distinct regimes of operation: Z-channel bound is tight. Z-channel bound is not tight.

  17. New Upper Bound • Genie only allows to give away the common information of user i to receiver i. • Results in a new interference channel. • Capacity of this channel can be explicitly computed!

  18. New Upper Bound + Z-Channel Bound is Tight

  19. Generalization • Han-Kobayashi scheme with private power set at INRp = 0dB is also within 1 bit to capacity for the entire region. • Also works for asymmetric channel. • Is there an intuitive explanation why this scheme is universally good?

  20. Review: Rate-Splitting Capacity of AWGN channel: dQ Q 1 noise-limited regime self-interference-limited regime

  21. Rate-Splitting View Yields Natural Private-Common Split • Think of the transmitted signal from user 1 as a superposition of many layers. • Plot the marginal rate functions for both the direct link and cross link in terms of received power Q in direct link. SNR= 20dB INR = 10dB private common INRp =0dB Q(dB)

  22. Conclusion • We present a simple scheme that achieves within one bit of the interference channel capacity. • All existing upper bounds require one receiver to decode both messages and can be arbitrarily loose. • We derived a new upper bound that requires neither user to decode each other’s message. • Results have interesting parallels with El Gamal and Costa (1982) for deterministic interference channels.

More Related