By Topic

Low complexity optimum transmit antenna selection algorithms in spatial multiplexing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Liang Zhou ; Fujitsu Laboratories Ltd., YRP R&D Center, 5-5, Hikari-no-Oka, Yokosuka-Shi, Kanagawa 239-0847, Japan

In this paper we propose low complexity optimum transmit antenna selection algorithms for wireless spatial multiplexing (SM) systems. Antenna selection with less radio frequency (RF) chains could significantly reduce the system cost and power consumption. Antenna selection criteria such as maximum minimum signal to interference plus noise ratio (SINR) and MMSE require computation of matrix inverse which has high computational complexity. Motivated by matrix inverse properties, several matrix inverse update formulas are developed for low complexity optimum transmit antenna selection. Different from the conventional optimum antenna selection algorithms, the proposed algorithms update matrix inverse based on the existed matrix inverse, so that the algorithmic complexity is reduced significantly. With greatly reduced complexity, the proposed algorithms are mathematically equivalent to the conventional optimum algorithms without any performance loss.

Published in:

21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications

Date of Conference:

26-30 Sept. 2010