The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
Abstract
For the fully connected K user wireless interference channel where the channel coefficients are time-varying and are drawn from a continuous distribution, the sum capacity is characterized as C(SNR)=K/2log(SNR)+o(log(SNR)) . Thus, the K user time-varying interference channel almost surely has K/2 degrees of freedom. Achievability is based on the idea of interference alignment. Examples are also provided of fully connected K user interference channels with constant (not time-varying) coefficients where the capacity is exactly achieved by interference alignment at all SNR values.
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
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
Jafar, S. A., & Shamai, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.911262 · Cited by 757
Self-citationApproaching the Capacity of Wireless Networks through Distributed Interference Alignment
Gomadam, K., Cadambe, V. R., & Jafar, S. A. (2008) · IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference · doi:10.1109/glocom.2008.ecp.817 · Cited by 731
Self-citationCarleial, 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
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
Annapureddy, V. S., & Veeravalli, V. V. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2021380 · Cited by 431
Capacity Bounds for the Gaussian Interference Channel
Motahari, A. S., & Khandani, A. K. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.2009807 · Cited by 430
The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels
Bresler, G., Parekh, A., & Tse, D. N. C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2054590 · Cited by 329
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
Feedback strategies for white Gaussian interference networks
Kramer, G. G. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003831 · Cited by 157
The Case for Structured Random Codes in Network Communication Theorems
Nazer, B., & Gastpar, M. (2007) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2007.4313084 · Cited by 28
Cited by
Andrews, J. G., Buzzi, S., Choi, W., Hanly, S. V., Lozano, A., Soong, A. C. K., & Zhang, J. C. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328098 · Cited by 8,106
MIMO Broadcasting for Simultaneous Wireless Information and Power Transfer
Zhang, R., & Ho, C. K. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.031813.120224 · Cited by 2,739
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
Stochastic geometry and random graphs for the analysis and design of wireless networks
Haenggi, M., Andrews, J. G., Baccelli, F., Dousse, O., & Franceschetti, M. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090902 · Cited by 1,719
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
Metadata
- Authors
- Cadambe, V. R., & Jafar, S. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2008-08
- Volume
- 54
- Issue
- 8
- Pages
- 3425-3441
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W1979408141
- Cited by
- 2,970
- References
- 13
- FWCI
- 169.74
- 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
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.