Abstract
This paper presents a practical algorithm for antenna selection in multiple-input multiple-output wireless communication systems employing space-time block codes (STBC). It first shows that maximizing the channel Frobenius norm helps maximize the mutual information for both orthogonal STBC and quasi-orthogonal STBC. However, the computational complexity for finding the optimal antenna subset grows exponentially with the number of antennas. This paper identifies that the channel Frobenius norm maximization problem can be formulated as a quadratically constrained quadratic programming (QCQP) problem. Then, despite the fact that the problem is non-convex, a semidefinite relaxation of QCQP enables the problem to be solved approximately by semidefinite programming in polynomial time. Simulation results indicate that the loss of semidefinite relaxation is negligible. It is also shown that although the combination of STBC and antenna selection is not always beneficial, it is a robust transmission strategy in the high SNR regime when only imperfect channel information is available.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
