TY - JOUR
T1 - Performance bounds for space-time block codes with receive antenna selection
AU - Zeng, Xiang Nian
AU - Ghrayeb, Ali
PY - 2004/9
Y1 - 2004/9
N2 - In this correspondence, we present a comprehensive performance analysis of orthogonal space-time block codes (STBCs) with receive antenna selection. For a given number of receive antennas M, we assume that the receiver uses the best L of the available M antennas, where, typically, L ≤ M. The selected antennas are those that maximize the instantaneous received signal-to-noise ratio (SNR). We derive explicit upper bounds on the bit-error rate (BER) performance of the above system for any M and L, and for any number of transmit antennas. We show that the diversity order, with antenna selection, is maintained as that of the full complexity system, whereas the deterioration in SNR is upper-bounded by 10 log10 (M/L) decibels. Furthermore, we derive a tighter upper bound for the BER performance for any N and M when L = 1, and derive an expression for the exact BER performance for the Alamouti scheme when L = 1. We also present simulation results that validate our analysis.
AB - In this correspondence, we present a comprehensive performance analysis of orthogonal space-time block codes (STBCs) with receive antenna selection. For a given number of receive antennas M, we assume that the receiver uses the best L of the available M antennas, where, typically, L ≤ M. The selected antennas are those that maximize the instantaneous received signal-to-noise ratio (SNR). We derive explicit upper bounds on the bit-error rate (BER) performance of the above system for any M and L, and for any number of transmit antennas. We show that the diversity order, with antenna selection, is maintained as that of the full complexity system, whereas the deterioration in SNR is upper-bounded by 10 log10 (M/L) decibels. Furthermore, we derive a tighter upper bound for the BER performance for any N and M when L = 1, and derive an expression for the exact BER performance for the Alamouti scheme when L = 1. We also present simulation results that validate our analysis.
UR - http://www.scopus.com/inward/record.url?scp=4544369932&partnerID=8YFLogxK
U2 - 10.1109/TIT.2004.833363
DO - 10.1109/TIT.2004.833363
M3 - Article
AN - SCOPUS:4544369932
SN - 0018-9448
VL - 50
SP - 2130
EP - 2137
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 9
ER -