Computationally Efficient Relay Antenna Selection for AF MIMO Two-Way Relay Channels

• Published in: IEEE transactions on signal processing Vol. 60; no. 11; pp. 6091 - 6097
• Main Authors: Heesun Park, Joohwan Chun, Adve, R.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01-11-2012; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Achievable sum rate; Algorithms; amplify-and-forward (AF); antenna selection; Antennas; Applied sciences; Channels; Complexity; Computation; Computational complexity; Computational efficiency; Detection, estimation, filtering, equalization, prediction; Exact sciences and technology; Information, signal and communications theory; MIMO; MIMO two-way relay channel; Receiving antennas; Relay; Relays; SAS; Signal and communications theory; Signal, noise; Telecommunications and information theory; Transmitting antennas; Upper bound; MIMO system; Multistage method; Relay; MIMO two-way relay channel; Two channel system; Transmission protocol; antenna selection; Algorithm; Computational complexity; Relay channel; Simulation; amplify-and-forward (AF); Transmitting antenna; Sequential method; Achievable sum rate; Signal processing; Routing protocols; Receiving antenna
• ISSN: 1053-587X; 1941-0476
• DOI: 10.1109/TSP.2012.2212435

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.