Abstract
Antenna selection with less radio frequency (RF) chains could reduce the system cost and power consumption in wireless communications. Conventional antenna selection criteria such as signal-to-interference-plus-noise ratio (SINR) and minimum mean square error (MMSE) that are suitable for linear receivers could not provide optimal performance for ordered successive interference cancellation (OSIC) receivers, and these criteria require computation of matrix inverse which has very high computational complexity. In this paper we propose low complexity optimal transmit antenna selection algorithms for spatial multiplexing (SM) systems with OSIC receivers. The proposed algorithms take into account optimal order detection in OSIC receivers, and avoid the direct matrix inverse operations by using recursive matrix inverse updates to reduce complexity. With greatly reduced complexity, the proposed algorithms are mathematically equivalent to the optimal algorithms without sacrificing performance for OSIC receivers.
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.
