TY - GEN
T1 - Time-reversal space-time equalization for amplify-and-forward relaying
AU - Mheidat, Hakam
AU - Uysal, Murat
AU - Al-Dhahir, Naofal
PY - 2006
Y1 - 2006
N2 - In this paper, we investigate time-domain equalization for distributed space-time codes in a relay-assisted transmission scenario over frequency-selective fading channels. Specifically, we consider the so-called time-reversal space-time block coding (TR-STBC) technique which has been of particular interest with its low computational complexity. We assume the special case of a single-relay where the source-to-relay (S → R), relay-to-destination (R → D), and source-to-destination (S → D) links experience possibly different channel delay spreads. Under the assumption of perfect power control for the relay terminal and high signal-to-noise ratio for the underlying links, our performance analysis demonstrates that distributed TR-STBC is able to achieve a maximum diversity order of min (L1, L3) + L2 + 2 where L1, L2, and L3 are the channel memory lengths for S → R, S → D, and R → D links, respectively. This illustrates that the smaller of the multipath diversity orders experienced in S → R and R → D links becomes the performance bottleneck for the relaying path. An extensive Monte Carlo simulation study is presented to corroborate the analytical results and to provide detailed performance comparisons with competing schemes.
AB - In this paper, we investigate time-domain equalization for distributed space-time codes in a relay-assisted transmission scenario over frequency-selective fading channels. Specifically, we consider the so-called time-reversal space-time block coding (TR-STBC) technique which has been of particular interest with its low computational complexity. We assume the special case of a single-relay where the source-to-relay (S → R), relay-to-destination (R → D), and source-to-destination (S → D) links experience possibly different channel delay spreads. Under the assumption of perfect power control for the relay terminal and high signal-to-noise ratio for the underlying links, our performance analysis demonstrates that distributed TR-STBC is able to achieve a maximum diversity order of min (L1, L3) + L2 + 2 where L1, L2, and L3 are the channel memory lengths for S → R, S → D, and R → D links, respectively. This illustrates that the smaller of the multipath diversity orders experienced in S → R and R → D links becomes the performance bottleneck for the relaying path. An extensive Monte Carlo simulation study is presented to corroborate the analytical results and to provide detailed performance comparisons with competing schemes.
KW - Cooperative diversity
KW - Distributed space-time block coding
KW - Equalization
KW - Fading channels
KW - Pairwise error probability
UR - http://www.scopus.com/inward/record.url?scp=42549140829&partnerID=8YFLogxK
U2 - 10.1109/ICC.2006.254965
DO - 10.1109/ICC.2006.254965
M3 - Conference contribution
AN - SCOPUS:42549140829
SN - 1424403553
SN - 9781424403554
T3 - IEEE International Conference on Communications
SP - 1705
EP - 1711
BT - 2006 IEEE International Conference on Communications, ICC 2006
T2 - 2006 IEEE International Conference on Communications, ICC 2006
Y2 - 11 July 2006 through 15 July 2006
ER -