The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
On the Achievable Diversity–Multiplexing Tradeoff in Half-Duplex Cooperative Channels
Abstract
We propose novel cooperative transmission protocols for delay-limited coherent fading channels consisting of N (half-duplex and single-antenna) partners and one cell site. In our work, we differentiate between the relay, cooperative broadcast (down-link), and cooperative multiple-access (CMA) (up-link) channels. The proposed protocols are evaluated using Zheng-Tse diversity-multiplexing tradeoff. For the relay channel, we investigate two classes of cooperation schemes; namely, amplify and forward (AF) protocols and decode and forward (DF) protocols. For the first class, we establish an upper bound on the achievable diversity-multiplexing tradeoff with a single relay. We then construct a new AF protocol that achieves this upper bound. The proposed algorithm is then extended to the general case with (N-1) relays where it is shown to outperform the space-time coded protocol of Laneman and Wornell without requiring decoding/encoding at the relays. For the class of DF protocols, we develop a dynamic decode and forward (DDF) protocol that achieves the optimal tradeoff for multiplexing gains 0lesrles1/N. Furthermore, with a single relay, the DDF protocol is shown to dominate the class of AF protocols for all multiplexing gains. The superiority of the DDF protocol is shown to be more significant in the cooperative broadcast channel. The situation is reversed in the CMA channel where we propose a new AF protocol that achieves the optimal tradeoff for all multiplexing gains. A distinguishing feature of the proposed protocols in the three scenarios is that they do not rely on orthogonal subspaces, allowing for a more efficient use of resources. In fact, using our results one can argue that the suboptimality of previously proposed protocols stems from their use of orthogonal subspaces rather than the half-duplex constraint.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
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
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
Zheng, L., & Tse, D. N. C. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810646 · Cited by 4,258
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
Cooperative Coding for Wireless Networks
Stefanov, A., & Erkip, E. (2004) · IEEE Transactions on Communications · doi:10.1109/tcomm.2004.833070 · Cited by 497
Cited by
An overview of limited feedback in wireless communication systems
Love, D., Heath, R., N. Lau, V., Gesbert, D., Rao, B., & Andrews, M. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.081002 · Cited by 1,503
The Relay–Eavesdropper Channel: Cooperation for Secrecy
Lai, L., & El Gamal, H. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.928272 · Cited by 774
Self-citationOn coding for reliable communication over packet networks
Lun, D. S., Médard, M., Koetter, R., & Effros, M. (2008) · Physical Communication · doi:10.1016/j.phycom.2008.01.006 · Cited by 559
Cooperative Jamming for Secure Communications in MIMO Relay Networks
Huang, J., & Swindlehurst, A. L. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2161295 · Cited by 347
Simultaneous Information and Energy Transfer in Large-Scale Networks with/without Relaying
Krikidis, I. (2014) · IEEE Transactions on Communications · doi:10.1109/tcomm.2014.020914.130825 · Cited by 283
Metadata
- Authors
- Azarian, K., ElGamal, H., & Schniter, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2005-12
- Volume
- 51
- Issue
- 12
- Pages
- 4152-4172
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2136209931
- Cited by
- 1,117
- References
- 7
- FWCI
- 136.77
- 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.