|
|
|
| A Low Complexity Gerschgorin Circle Transmit Antenna Selection Algorithm for MIMO Systems |
| Hei Yong-qiang; Li Xiao-hui; Yi Ke-chu |
| State Key Laboratory of Integrated Services Networks, Xidian University, Xi’an 710071, China |
|
|
|
|
Abstract This paper begins with the investigation on exhaustive search algorithm, the Gerschgorin circle algorithm, on the basis of which, a Gerschgorin circle with low complexity is presented. In the proposed algorithm, the column corresponding to the minimum eigen-value is eliminated to increase the lower bound of the eigen-values and to reduce the correlation between the antennas during each iteration, correspondingly, capacity is maximized or BER is minimized. The results of the research reveal that both the capacity and the BER performance of the proposed algorithm are better than that of the norm-based algorithm, and are close to the performance of the optimal exhaustive search algorithm with low complexity in the cases that more antennas are selected.
|
|
Received: 11 September 2006
|
|
|
|
|
|
|
|
|
2008, Vol. 30 
