The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Gaussian Interference Channel Capacity to Within One Bit
Open accessAbstract
The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is due to Han and Kobayashi but its characterization is very complicated. It is also not known how tight the existing outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a very simple and explicit Han-Kobayashi type scheme can achieve to within a single bit per second per hertz (bit/s/Hz) of the capacity for all values of the channel parameters. We also show that the scheme is asymptotically optimal at certain high signal-to-noise ratio (SNR) regimes. Using our results, we provide a natural generalization of the point-to-point classical notion of degrees of freedom to interference-limited scenarios.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A new achievable rate region for the interference channel
Han, T., & Kobayashi, K. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056307 · Cited by 1,588
The capacity of the Gaussian interference channel under strong interference (Corresp.)
Sato, H. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056416 · Cited by 623
A case where interference does not reduce capacity (Corresp.)
Carleial, A. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055432 · Cited by 533
On The Han–Kobayashi Region for theInterference Channel
Chong, H.-F., Motani, M., Garg, H. K., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.924720 · Cited by 314
The capacity region of a class of deterministic interference channels (Corresp.)
Gamal, A. E., & Costa, M. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056466 · Cited by 275
Outer Bounds on the Capacity of Gaussian Interference Channels
Kramer, G. G. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.825249 · Cited by 270
A Deterministic Approach to Wireless Relay Networks
Avestimehr, A. S., Diggavi, S. N., & Tse, D. N. C. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.3777 · Cited by 230
Self-citation
Cited by
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
Cadambe, V. R., & Jafar, S. A. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926344 · Cited by 2,970
Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective
Goldsmith, A., Jafar, S. A., Maric, I., & Srinivasa, S. (2009) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2015717 · Cited by 2,398
Multi-Cell MIMO Cooperative Networks: A New Look at Interference
Gesbert, D., Hanly, S., Huang, H., Shamai Shitz, S., Simeone, O., & Yu, W. (2010) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2010.101202 · Cited by 1,760
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Compute-and-Forward: Harnessing Interference Through Structured Codes
Nazer, B., & Gastpar, M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165816 · Cited by 990
Metadata
- Authors
- Etkin, R. H., Tse, D. N. C., & Wang, H.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-12
- Volume
- 54
- Issue
- 12
- Pages
- 5534-5562
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2157989362
- Cited by
- 1,370
- References
- 7
- FWCI
- 254.59
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.