Abstract
For reducing the computational complexity of the problem of joint transmit and receive antenna selection in Multiple-Input-Multiple-Output (MIMO) systems, we present a concise joint transmit/receive antenna selection algorithm. Using a novel partition of the channel matrix, we drive a concise formula. This formula enables us to augment the channel matrix in such a way that the computational complexity of the greedy Joint Transmit/Receive Antenna Selection (JTRAS) algorithm is reduced by a factor of 4nL, where nL is the number of selected antennas. A decoupled version of the proposed algorithm is also proposed to further improve the efficiency of the JTRAS algorithm, with some capacity degradation as a tradeoff. The computational complexity and the performance of the proposed approaches are evaluated mathematically and verified by computer simulations. The results have shown that the proposed joint antenna selection algorithm maintains the capacity performance of the JTRAS algorithm while its computational complexity is only 1/4nL of that of the JTRAS algorithm. The decoupled version of the proposed algorithm further reduces the computational complexity of the joint antenna selection and has better performance than other decoupling-based algorithms when the selected antenna subset is small as compared to the total number of antennas.
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.
