The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Capacity Bounds for the Gaussian Interference Channel
Abstract
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 ICs. 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 are 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Rockafellar, R. T., & Wets, R. J. B. (1998) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-02431-3 · Cited by 4,086
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Cover, T. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054727 · Cited by 1,670
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
Gaussian Interference Channel Capacity to Within One Bit
Etkin, R. H., Tse, D. N. C., & Wang, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2006447 · Cited by 1,370
Spectrum sharing for unlicensed bands
Etkin, R., Parekh, A., & Tse, D. (2007) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2007.070402 · Cited by 859
Carleial, A. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055812 · Cited by 694
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
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
Massive MIMO Networks: Spectral, Energy, and Hardware Efficiency
Björnson, E., Hoydis, J., & Sanguinetti, L. (2017) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000093 · Cited by 2,137
(2005) · Elements of Information Theory · doi:10.1002/047174882x.ch15 · Cited by 1,504
Foundations of User-Centric Cell-Free Massive MIMO
Demir, Ȕ. T., BjɆrnson, E., & Sanguinetti, L. (2021) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000109 · Cited by 704
Metadata
- Authors
- Motahari, A. S., & Khandani, A. K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2009-02
- Volume
- 55
- Issue
- 2
- Pages
- 620-643
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2062610219
- Cited by
- 430
- References
- 14
- FWCI
- 80.14
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Capacity Bounds for the Gaussian Interference Channel. https://app.cochat.ai/papers/10.1109/tit.2008.2009807
- The paper
- Motahari, A. S., & Khandani, A. K. (2009). Capacity Bounds for the Gaussian Interference Channel. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2008.2009807
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.