TY - JOUR
T1 - Antenna selection for multiple-antenna transmission systems
T2 - Performance analysis and code construction
AU - Bahceci, Israfil
AU - Altunbasak, Yucel
N1 - Funding Information: Manuscript received October 30, 2002; revised June 15, 2003. This work was supported in part by the National Science Foundation under Awards CCR-0105654 and INT-0217549, and under the National Science Foundation CAREER Award CCR-9984237. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Yokohama, Japan, June/July 2003.
PY - 2003/10
Y1 - 2003/10
N2 - This correspondence studies antenna selection for wireless communications systems that employ multiple transmit and receive antennas. We assume that 1) the channel is characterized by quasi-static Rayleigh flat fading, and the subchannels fade independently, 2) the channel state information (CSI) is exactly known at the receiver, 3) the selection is available only at the receiver, and it is based on the instantaneous signal-to-noise ratio (SNR) at each receiver antenna, and 4) space-time codes are used at the transmitter. We analyze the performance of such systems by deriving explicit upper bounds on the pairwise error probability (PEP). This performance analysis shows that 1) by selecting the set of antennas that observe the largest instantaneous SNR, one can achieve the same diversity gain as the one obtained by using all the receive antennas, provided that the underlying space-time code has full spatial diversity, and 2) in the case of rank-deficient space-time codes, the diversity gain may be dramatically reduced when antennas selection is used. However, we emphasize that in both cases the coding gain is reduced with antenna selection compared to the full complexity system. Based on the upper bounds derived, we describe code design principles suitable for antenna selection. Specifically, for systems with two transmit antennas, we design space-time codes that perform better than the known ones when antenna selection is employed. Finally, we present numerical examples and simulation results that validate our analysis and code design principles.
AB - This correspondence studies antenna selection for wireless communications systems that employ multiple transmit and receive antennas. We assume that 1) the channel is characterized by quasi-static Rayleigh flat fading, and the subchannels fade independently, 2) the channel state information (CSI) is exactly known at the receiver, 3) the selection is available only at the receiver, and it is based on the instantaneous signal-to-noise ratio (SNR) at each receiver antenna, and 4) space-time codes are used at the transmitter. We analyze the performance of such systems by deriving explicit upper bounds on the pairwise error probability (PEP). This performance analysis shows that 1) by selecting the set of antennas that observe the largest instantaneous SNR, one can achieve the same diversity gain as the one obtained by using all the receive antennas, provided that the underlying space-time code has full spatial diversity, and 2) in the case of rank-deficient space-time codes, the diversity gain may be dramatically reduced when antennas selection is used. However, we emphasize that in both cases the coding gain is reduced with antenna selection compared to the full complexity system. Based on the upper bounds derived, we describe code design principles suitable for antenna selection. Specifically, for systems with two transmit antennas, we design space-time codes that perform better than the known ones when antenna selection is employed. Finally, we present numerical examples and simulation results that validate our analysis and code design principles.
KW - Antenna selection
KW - Diversity
KW - Multiple-antenna communications
KW - Multiple-input multiple-output (MIMO) systems
KW - Pairwise error probability (PEP)
KW - Space-time coding
KW - Wireless communications
UR - http://www.scopus.com/inward/record.url?scp=0242302504&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0242302504&partnerID=8YFLogxK
U2 - 10.1109/TIT.2003.817455
DO - 10.1109/TIT.2003.817455
M3 - Letter
SN - 0018-9448
VL - 49
SP - 2669
EP - 2681
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 10
ER -