The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks
Abstract
In this paper, a novel relaying strategy that uses multiple-input multiple-output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks is proposed. The fixed relay processes the received signal with linear operations and forwards the processed signal to multiple users creating a multiuser MIMO relay. This paper proposes upper and lower bounds on the achievable sum rate for this architecture assuming zero-forcing dirty paper coding at the base station, neglecting the direct links from the base station to the users, and with certain structure in the relay. These bounds are used to motivate an implementable multiuser precoding strategy that combines Tomlinson-Harashima precoding at the base station and linear signal processing at the relay, adaptive stream selection, and QAM modulation. Reduced complexity algorithms based on the sum rate lower bounds are used to select a subset of users. We compare the sum rates achieved by the proposed system architecture and algorithms with the sum rate upper bound and the sum rate achieved by the decode-and-forward relaying.
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
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
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Capacity of Multi‐antenna Gaussian Channels
Telatar, E. (1999) · European Transactions on Telecommunications · doi:10.1002/ett.4460100604 · Cited by 11,234
Horn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
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
Foschini, G. J. (2002) · Bell Labs Technical Journal · doi:10.1002/bltj.2015 · Cited by 6,205
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
From theory to practice: an overview of MIMO space-time coded wireless systems
Gesbert, D., Shafi, M., Shiu, D.-S., Smith, P. J., & Naguib, A. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.809458 · Cited by 2,295
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
Relay-based deployment concepts for wireless and mobile broadband radio
Pabst, R., Walke, B. H., Schultz, D. C., Herhold, P., Yanikomeroglu, H., Mukherjee, S., Viswanathan, H., Lott, M., Zirwas, W., Dohler, M., et al. (2004) · IEEE Communications Magazine · doi:10.1109/mcom.2004.1336724 · Cited by 1,681
Grassmannian beamforming for multiple-input multiple-output wireless systems
Love, D. J., Heath, R. W., & Strohmer, T. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.817466 · Cited by 1,505
Self-citationSum 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
Energy-efficient antenna sharing and relaying for wireless networks
Laneman, J. N., & Wornell, G. W. (2002) · 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540) · doi:10.1109/wcnc.2000.904590 · Cited by 846
On the capacity of MIMO relay channels
Wang, B., Zhang, J., & Host-Madsen, A. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839487 · Cited by 813
Precoding in Multiantenna and Multiuser Communications
Windpassinger, C., Fischer, R. F. H., Vencel, T., et al. (2004) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2004.830852 · Cited by 558
Adaptive modulation and MIMO coding for broadband wireless data networks
Catreux, S., Erceg, V., Gesbert, D., & Heath, R. W. (2002) · IEEE Communications Magazine · doi:10.1109/mcom.2002.1007416 · Cited by 434
Self-citationGeometric Programming for Communication Systems
Chiang, M. (2005) · now publishers, Inc. eBooks · doi:10.1561/9781933019574 · Cited by 423
Chen, R., Heath, R. W., & Andrews, J. G. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.887147 · Cited by 137
Self-citation
Cited by
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
Huang, C., Zappone, A., Alexandropoulos, G. C., Debbah, M., & Yuen, C. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2922609 · Cited by 3,761
Spatial Modulation for Generalized MIMO: Challenges, Opportunities, and Implementation
Di Renzo, M., Haas, H., Ghrayeb, A., Sugiura, S., & Hanzo, L. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2013.2287851 · Cited by 1,446
Full-Duplex Wireless Communications: Challenges, Solutions, and Future Research Directions
Zhang, Z., Long, K., Vasilakos, A. V., & Hanzo, L. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2497203 · Cited by 620
Metadata
- Authors
- Chae, C.-B., Tang, T., Heath, R. W., & Cho, S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2008-02
- Volume
- 56
- Issue
- 2
- Pages
- 727-738
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2136877591
- Cited by
- 311
- References
- 19
- FWCI
- 75.17
- 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.