The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
On the Degrees of Freedom Achievable Through Interference Alignment in a MIMO Interference Channel
Open accessAbstract
Consider a K-user flat fading MIMO interference channel where the kth transmitter (or receiver) is equipped with Mk(respectively Nk) antennas. If an exponential (in K) number of generic channel extensions are used either across time or frequency, Cadambe and Jafar [1] showed that the total achievable degrees of freedom (DoF) can be maximized via interference alignment, resulting in a total DoF that grows linearly with A even if Mkand Nkare bounded. In this work we consider the case where no channel extension is allowed, and establish a general condition that must be satisfied by any degrees of freedom tuple (d1. d2....dK) achievable through linear interference alignment. For a symmetric system with Mk= M, Nk= N, dk= d for all k, this condition implies that the total achievable DoF cannot grow linearly with K, and is in fact no more than K(M + N)/(K + 1). We also show that this bound is tight when the number of antennas at each transceiver is divisible by d, the number of data streams per user.
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
(2010) · Introduction to Combinatorics · doi:10.1201/b12336-12 · Cited by 5,632
Fields, J. (2001) · Cited by 4,160
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
Introduction To Commutative Algebra
Atiyah, M. (2018) · CRC Press eBooks · doi:10.1201/9780429493638 · Cited by 2,883
Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis
Maddah-Ali, M. A., Motahari, A. S., & Khandani, A. K. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926460 · Cited by 1,008
Dynamic Spectrum Management: Complexity and Duality
Luo, Z.-Q., & Zhang, S. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.914876 · Cited by 929
Self-citationShi, Q., Razaviyayn, M., Luo, Z.-Q., & He, C. (2011) · 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2011.5946304 · Cited by 873
Self-citationJafar, S. A., & Shamai, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.911262 · Cited by 757
Interference alignment via alternating minimization
Peters, S. W., & Heath, R. W. (2009) · 2009 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2009.4960116 · Cited by 438
Linear transceiver design for interference alignment: Complexity and computation
Razaviyayn, M., Boroujeni, M. S., & Luo, Z.-Q. T. (2010) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2010.5670807 · Cited by 30
Self-citation
Cited by
Low-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit
Shi, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2544758 · Cited by 56
Metadata
- Authors
- Razaviyayn, M., Lyubeznik, G., & Luo, Z.-Q.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2012-02
- Volume
- 60
- Issue
- 2
- Pages
- 812-821
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W1971328044
- Cited by
- 257
- References
- 10
- FWCI
- 26.74
- 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.