The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
On the capacity of MIMO relay channels
Abstract
We study the capacity of multiple-input multiple- output (MIMO) relay channels. We first consider the Gaussian MIMO relay channel with fixed channel conditions, and derive upper bounds and lower bounds that can be obtained numerically by convex programming. We present algorithms to compute the bounds. Next, we generalize the study to the Rayleigh fading case. We find an upper bound and a lower bound on the ergodic capacity. It is somewhat surprising that the upper bound can meet the lower bound under certain regularity conditions (not necessarily degradedness), and therefore the capacity can be characterized exactly; previously this has been proven only for the degraded Gaussian relay channel. We investigate sufficient conditions for achieving the ergodic capacity; and in particular, for the case where all nodes have the same number of antennas, the capacity can be achieved under certain signal-to-noise ratio (SNR) conditions. Numerical results are also provided to illustrate the bounds on the ergodic capacity of the MIMO relay channel over Rayleigh fading. Finally, we present a potential application of the MIMO relay channel for cooperative communications in ad hoc networks.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Table of Integrals, Series, and Products
(1980) · Elsevier eBooks · doi:10.1016/c2013-0-10754-4 · Cited by 18,782
Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838089 · Cited by 12,193
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Table of Integrals, Series, and Products
(2000) · Elsevier eBooks · doi:10.1016/b978-0-12-294757-5.x5000-4 · Cited by 8,408
User cooperation diversity-part I: system description
Sendonaris, A., Erkip, E., & Aazhang, B. (2003) · IEEE Transactions on Communications · doi:10.1109/tcomm.2003.818096 · Cited by 6,285
Horn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
Capacity theorems for the relay channel
Cover, T., & Gamal, A. E. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056084 · Cited by 4,123
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
Laneman, J. N., & Wornell, G. W. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817829 · Cited by 4,002
On the achievable throughput of a multiantenna Gaussian broadcast channel
Caire, G., & Shamai, S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813523 · Cited by 2,527
Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channels
Vishwanath, S., Jindal, N., & Goldsmith, A. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817421 · Cited by 1,683
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
Marzetta, T. L., & Hochwald, B. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746779 · Cited by 1,348
Gupta, A. K., & Nagar, D. K. (2018) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203749289 · Cited by 1,295
Sum capacity of the vector Gaussian broadcast channel and uplink–downlink duality
Viswanath, P., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814483 · Cited by 1,290
Iterative Water-Filling for Gaussian Vector Multiple-Access Channels
Yu, W., Rhee, W., Boyd, S., & Cioffi, J. M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.821988 · Cited by 1,026
Sum Capacity of Gaussian Vector Broadcast Channels
Yu, W., & Cioffi, J. M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833336 · Cited by 742
Shannon-theoretic approach to a Gaussian cellular multiple-access channel
Wyner, A. D. (1994) · IEEE Transactions on Information Theory · doi:10.1109/18.340450 · Cited by 729
A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
Xie, L.-L., & Kumar, P. R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.826631 · Cited by 723
Cited by
Optimal Design of Non-Regenerative MIMO Wireless Relays
Tang, X., & Hua, Y. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.348336 · Cited by 698
A Survey of In-Band Full-Duplex Transmission: From the Perspective of PHY and MAC Layers
Kim, D., Lee, H., & Hong, D. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2403614 · Cited by 603
(2006) · Springer eBooks · doi:10.1007/1-4020-4711-8 · Cited by 363
Rong, Y., Tang, X., & Hua, Y. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2027779 · Cited by 363
MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks
Chae, C.-B., Tang, T., Heath, R. W., & Cho, S. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.907821 · Cited by 311
Metadata
- Authors
- Wang, B., Zhang, J., & Host-Madsen, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2005-01
- Volume
- 51
- Issue
- 1
- Pages
- 29-43
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2106801259
- Cited by
- 813
- References
- 19
- FWCI
- 60.96
- 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.