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

Cited 20 time in webofscience Cited 0 time in scopus
  • Hit : 429
  • Download : 9
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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2012-11
Language
English
Article Type
Article
Keywords

SUBSET-SELECTION; SYSTEMS; NETWORKS; CAPACITY; INTERFERENCE; PROTOCOLS; SCHEME; DESIGN

Citation

IEEE TRANSACTIONS ON SIGNAL PROCESSING, v.60, no.11, pp.6091 - 6097

ISSN
1053-587X
DOI
10.1109/TSP.2012.2212435
URI
http://hdl.handle.net/10203/102743
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 20 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0