The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Completely Stale Transmitter Channel State Information is Still Very Useful
Abstract
Transmitter channel state information (CSIT) is crucial for the multiplexing gains offered by advanced interference management techniques such as multiuser multiple-input multiple-output (MIMO) and interference alignment. Such CSIT is usually obtained by feedback from the receivers, but the feedback is subject to delays. The usual approach is to use the fed back information to predict the current channel state and then apply a scheme designed assuming perfect CSIT. When the feedback delay is large compared to the channel coherence time, such a prediction approach completely fails to achieve any multiplexing gain. In this paper, we show that even in this case, the completely stale CSI is still very useful. More concretely, we show that in an MIMO broadcast channel with$K$transmit antennas and$K$receivers each with 1 receive antenna,${{K}\over{1+{{1}\over{2}}+\ldots+{{1}\over{K}}}}(>1)$degrees of freedom is achievable even when the fed back channel state is completely independent of the current channel state. Moreover, we establish that if all receivers have independent and identically distributed channels, then this is the optimal number of degrees of freedom achievable. In the optimal scheme, the transmitter uses the fed back CSI to learn the side information that the receivers receive from previous transmissions rather than to predict the current channel state. Our result can be viewed as the first example of feedback providing a degree-of-freedom gain in memoryless channels.
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
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
The zero error capacity of a noisy channel
Shannon, C. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056798 · Cited by 1,468
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
Self-citationMultiuser MIMO Achievable Rates With Downlink Training and Channel State Feedback
Caire, G., Jindal, N., Kobayashi, M., & Ravindran, N. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046225 · Cited by 537
Multiuser MIMO achievable rates with downlink training and channel state feedback
Caire, G., Jindal, N., Kobayashi, M., & Ravindran, N. (2010) · HAL · Cited by 533
Capacity of Markov channels with receiver CSI and delayed feedback
Viswanathan, H. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.749027 · Cited by 148
Broadcast erasure channel with feedback - Capacity and algorithms
Georgiadis, L. G., & Tassiulas, L. (2009) · International Symposium on Network Coding (NetCod) · doi:10.1109/netcod.2009.5191394 · Cited by 135
Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms
Gatzianas, M. A., Georgiadis, L. G., & Tassiulas, L. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2265692 · Cited by 112
Cited by
Xu, W., Yang, Z., Ng, D. W. K., Levorato, M., Eldar, Y. C., & Debbah, M. (2023) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2023.3239189 · Cited by 660
Peng, M., Sun, Y., Li, X., Mao, Z., & Wang, C. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2548658 · Cited by 386
Energy-Efficient Processing and Robust Wireless Cooperative Transmission for Edge Inference
Yang, K., Shi, Y., Yu, W., & Ding, Z. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2979523 · Cited by 65
Robust Group Sparse Beamforming for Multicast Green Cloud-RAN With Imperfect CSI
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2442957 · Cited by 63
Optimal Stochastic Coordinated Beamforming for Wireless Cooperative Networks With CSI Uncertainty
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385669 · Cited by 61
Metadata
- Authors
- Maddah-Ali, M. A., & Tse, D.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2012-07
- Volume
- 58
- Issue
- 7
- Pages
- 4418-4431
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2124982134
- Cited by
- 467
- References
- 8
- FWCI
- 41.51
- 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.