#### DMCA

## Gaussian interference channel capacity to within one bit

### Cached

### Download Links

- [www.hpl.hp.com]
- [www.eecs.berkeley.edu]
- [www.hpl.hp.com]
- [arxiv.org]
- [arxiv.org]
- [arxiv.org]
- [www.eecs.berkeley.edu]
- [www.hpl.hp.com]
- DBLP

### Other Repositories/Bibliography

Venue: | 5534–5562, 2008. EURASIP Journal on Advances in Signal Processing |

Citations: | 444 - 27 self |

### Citations

473 |
A new achievable rate region for the interference channel
- Han, Kobayashi
- 1981
(Show Context)
Citation Context ...or over thirty years. The only case in which the capacity is known is in the strong interference case, where each receiver has a better reception of the other user’s signal than the intended receiver =-=[1, 2]-=-. The best known strategy for the other cases is due to Han and Kobayashi [1]. This strategy is a natural one and involves splitting the transmitted information of both users into two parts: private i... |

238 |
The capacity of the Gaussian interference channel under strong interference
- Sato
- 1981
(Show Context)
Citation Context ...ong interference channel In this case, the parameters of the Gaussian interference channel satisfy INR1 ≥ SNR2 and INR2 ≥ SNR1. The capacity region of the strong interference channel is already known =-=[7]-=-. In the following, we will show that we can get to within one bit of the capacity region of the Gaussian interference channel for both the weak interference channel and the mixed interference channel... |

224 | Multi-access Fading Channels: Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities
- Tse, Hanly
- 1998
(Show Context)
Citation Context ...n be interpreted in the following way: r1(z) · dz (r2(z) · dz) is the rate that can be achieved in a sub-message of power dz facing an interference of power z · SNR1 (z · INR2) in channel 1 (2). (See =-=[11]-=- p. 2802, where this concept is introduced). These functions can also be interpreted as the marginal increase in rate at interference level z · SNR1 (or z · INR2). Imagine we plot these two functions ... |

131 |
The capacity region of a class of deterministic interference channels
- Gamal, Costa
- 1982
(Show Context)
Citation Context ...vides intuition about the simple Han-Kobayashi scheme used in this paper. Section 7 explores some analogies between our results and those of El Gamal and Costa on a deterministic interference channel =-=[3]-=-. Regarding notation, we will use lowercase or uppercase letters for scalars, lowercase boldface letters for vectors, and calligraphic letters for sets. For example we write h or P for scalars, x for ... |

130 | A Deterministic Approach to Wireless Relay Networks
- Avestimehr, Diggavi, et al.
- 2007
(Show Context)
Citation Context ...one. In [13], a class of noisy interference channels is considered, which subsumes the Gaussian interference channel and the El Gamal and Costa deterministic interference channel as special cases. In =-=[14]-=-, a deterministic channel model is proposed to approximate general Gaussian networks. When specialized to the two-user interference channel, this model is a special case of the El Gamal and Costa mode... |

117 |
The two-user Gaussian interference channel: a deterministic view
- Bresler, Tse
- 2008
(Show Context)
Citation Context ...nnel model is proposed to approximate general Gaussian networks. When specialized to the two-user interference channel, this model is a special case of the El Gamal and Costa model and it is shown in =-=[15]-=- that in fact the capacity region of this channel matches exactly the generalized degrees of freedom region of the Gaussian interference channel we derived here. APPENDIX A ANALYSIS OF UPPER BOUND OF ... |

116 | The worst additive noise under a covariance constraint - Diggavi, Cover - 2001 |

114 | On the Gaussian interference channel - Costa - 1985 |

103 |
On achievable rate regions for the Gaussian interference channel
- Sason
- 2004
(Show Context)
Citation Context ... channel is equivalent to the one-sided interference channel depicted in Figure 7. The sum rate capacity of a one-sided interference channel for the case of INR2 < SNR1 is known from previous results =-=[8]-=- and will be explicitly derived in Section 4.1. It is given by: � Rsum(one-sided IC) = log (1 + SNR1) + log 1 + SNR2 � 1 + INR2 and since the aid of the genie can only increase the capacity region of ... |

99 |
A case where interference does not reduce capacity
- Carleial
- 1975
(Show Context)
Citation Context ...or over thirty years. The only case in which the capacity is known is in the strong interference case, where each receiver has a better reception of the other user’s signal than the intended receiver =-=[1, 2]-=-. The best known strategy for the other cases is due to Han and Kobayashi [1]. This strategy is a natural one and involves splitting the transmitted information of both users into two parts: private i... |

96 | On the Han-Kobayashi region for interference channel
- Chong, Motani, et al.
- 2008
(Show Context)
Citation Context ...2 � + ɛ. 1 + INR1 (56) The Han-Kobayashi scheme [1] is the best known achievable scheme for the interference channel. Recently a simplified yet equivalent Han-Kobayashi achievable region was given in =-=[10]-=-, which we state in the following lemma. 29sLemma 1. Let P ∗ be the set of joint probability distributions P ∗ (·) that factor as P ∗ (q, w1, w2, x1, x2, y1, y2) = P (q) · P (w1, x1|q) · P (w2, x2|q) ... |

93 |
Outer bounds on the capacity of gaussian interference channels
- Kramer
- 2004
(Show Context)
Citation Context ...is upper bound by considering any outer bound to the interference channel capacity region evaluated at R1 = R2. The best known outer bound to the interference channel capacity region is that given in =-=[6]-=- Theorem 2. We analyze this bound in Appendix A, and provide in this section an alternative bound that has similar performance and is easier to obtain and analyze. We will consider a general interfere... |

82 |
Carleial, “A case where interference does not reduce capacity
- B
- 1975
(Show Context)
Citation Context ...r over 30 years. The only case in which the capacity is known is in the strong interference case, where each receiver has a better reception of the other user’s signal than the intended receiver [1], =-=[2]-=-. The best known strategy for the other cases is due to Han and Kobayashi [1]. This strategy is a natural one and involves splitting the transmitted information of both users into two parts: private i... |

36 |
On degraded Gaussian two-user channels
- Sato
- 1978
(Show Context)
Citation Context ...milarly we can derive the bound for R1 + 2R2. Remark 1. As mentioned, our first bound on R1 + R2 is also an outer bound on the sum rate of the one-sided interference channel (also known as Z-channel) =-=[4, 5, 8]-=- generated by removing the link from transmitter 2 to receiver 1. In the one-sided channel, this outer bound can actually be achieved by both users when they communicate using codebooks generated from... |

8 | The two user Gaussian compound interference channel,” preprint
- Raja, Prabhakaran, et al.
- 2009
(Show Context)
Citation Context ...zation of [11, Theorem 1] to a noncompound interference channel, noting that the region of Lemma 1 is obtained by applying the Fourier–Motzkin elimination procedure to the inequalities that define in =-=[11]-=-, together with and ). Lemma 1: Let be the set of joint probability distributions that factor as (51) (54) Authorized licensed use limited to: Hewlett-Packard via the HP Labs Research Library. Downloa... |

1 |
On the capacity of a class of interference channels
- Telatar, Tse
- 2007
(Show Context)
Citation Context ...erence channel with weak and mixed interference. The connection between Gaussian and deterministic channel models is strengthened in several subsequent works since the present work was first done. In =-=[13]-=-, a class of noisy interference channels is considered, which subsumes the Gaussian interference channel and the El Gamal and Costa deterministic interference channel as special cases. In [14], a dete... |

1 | Carleial, A case where interference does not reduce capacity - Theory - 1981 |

1 | The capacity region of a class of deterministic interference channels - IT-21 - 1975 |