Please use this identifier to cite or link to this item:
Title: On the diversity-multiplexing tradeoff of amplify-and-forward half-duplex relaying
Authors: Wicaksana, H.
Ting, S.H.
Motani, M. 
Guan, Y.L.
Keywords: Amplify-and-forward
diversity-multiplexing tradeoff (DMT)
half-duplex relaying
two-path relaying
Issue Date: Dec-2010
Citation: Wicaksana, H., Ting, S.H., Motani, M., Guan, Y.L. (2010-12). On the diversity-multiplexing tradeoff of amplify-and-forward half-duplex relaying. IEEE Transactions on Communications 58 (12) : 3621-3630. ScholarBank@NUS Repository.
Abstract: In this paper, an amplify-and-forward (AF) two-path half-duplex relaying scheme is considered in which one of the relays additionally performs inter-relay interference cancellation. We first generalize lower bounds for the diversity-multiplexing tradeoff (DMT) of an arbitrary block lower triangular channel matrix. We then characterize the diversity-multiplexing tradeoff for the AF two-path relaying scheme and show that the DMT achieves the multiple-input single-output (MISO) upper bound. The analysis also demonstrates that, with a careful choice of the coding strategy, the DMT of this scheme is achievable for finite codeword lengths. We then propose using an equivalent linear space time code at the source, which does not require any form of channel state information, as a simple and effective coding strategy to achieve the full DMT of the scheme. From the DMT perspective, the proposed AF two-path relaying with the equivalent linear space time coding outperforms existing schemes. Our analysis is then extended to the slotted-amplify-and-forward (SAF) scheme with multiple relays, where we provide a stronger result by deriving the DMT while taking into account inter-relay interference. © 2010 IEEE.
Source Title: IEEE Transactions on Communications
ISSN: 00906778
DOI: 10.1109/TCOMM.2010.100510.090385
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 18, 2019


checked on Mar 18, 2019

Page view(s)

checked on Mar 16, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.