Abstract
This correspondence develops a computationally efficient scheme to select a subset of relay antennas to maximize the achievable sum rate (ASR) of amplify-and-forward multiple-input multiple-output two-way relay channels. To reduce the computational complexity of antenna selection (AS), two sequential AS algorithms, joint AS (JAS) and separate AS (SAS), are proposed. JAS jointly selects a pair of receive-transmit antennas at each sequential step. In contrast, SAS separates receive and transmit AS into a two-stage algorithm; the receive antenna set is selected first, followed by selection of the transmit antennas. Simulation results show that the proposed algorithms achieve nearly the same ASR as compared to an exhaustive search, but with significantly reduced computational complexity.
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.
