DocumentCode
456234
Title
A fast sub-optimal antenna selection algorithm in mimo systems
Author
Liu, Shenfa ; He, Zhiqiang ; Wu, Weiling ; Chang, Xin ; Li, Zheng ; Schulz, Egon
Author_Institution
Sch. of Inf. Eng., Beijing Univ. of Posts & Telecommun.
Volume
2
fYear
2006
fDate
3-6 April 2006
Firstpage
734
Lastpage
739
Abstract
MIMO systems can offer high multiplexing and diversity gain, but the increased complexity hampers the practical applications. Through antenna selection, the complexity and cost can be greatly reduced while the gain of MIMO systems can be reserved. In this paper, a fast sub-optimal antenna selection algorithm based on norm and correlation is proposed for maximizing the channel capacity. Compared with the near-optimal selection algorithm of M. Gharavi-Alkhansari and A. Greshman (2004), our sub-optimal algorithm can capture most of the capacity property while the complexity and memory requirement are greatly decreased. Simulation results show that our algorithm is very effective when SNR is high and the number of the selected antennas is relatively small. Especially for a rank deficient channel matrix, the sub-optimal algorithm outperforms the norm-based selection algorithm. Our algorithm also shows capacity advantages when compared with the correlation based method (CBM) algorithm of Y.S. Choi et al. (2003)
Keywords
MIMO systems; antenna arrays; matrix algebra; MIMO systems; SNR; channel capacity; channel matrix; sub-optimal antenna selection algorithm; Channel capacity; Computational complexity; Costs; Diversity methods; Greedy algorithms; Helium; Intelligent networks; MIMO; Receiving antennas; Transmitting antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications and Networking Conference, 2006. WCNC 2006. IEEE
Conference_Location
Las Vegas, NV
ISSN
1525-3511
Print_ISBN
1-4244-0269-7
Electronic_ISBN
1525-3511
Type
conf
DOI
10.1109/WCNC.2006.1683559
Filename
1683559
Link To Document