Two-Hop AF MIMO Relay System Optimization With Own Information From the Relay Node
In this paper, we consider precoding matrices optimization for a new two-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system, where in addition to forwarding the source signals, the relay node concurrently transmits its own signals to the destination node. Compared with c...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
IEEE
2019
|
| Online Access: | http://purl.org/au-research/grants/arc/DP140102131 http://hdl.handle.net/20.500.11937/73907 |
| _version_ | 1848763129556631552 |
|---|---|
| author | Su, Q. Rong, Yue |
| author_facet | Su, Q. Rong, Yue |
| author_sort | Su, Q. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | In this paper, we consider precoding matrices optimization for a new two-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system, where in addition to forwarding the source signals, the relay node concurrently transmits its own signals to the destination node. Compared with conventional AF MIMO relay systems where the relay node only forwards the source signals, the transceiver optimization problem in the new system is more challenging to solve. We prove that for all Schur-concave objective functions, the optimal source and relay matrices jointly diagonalize the source-relay-destination and relay-destination channels, which simplifies the matrices optimization problem to a joint subchannel and power allocation problem with scalar variables. It is shown that to achieve a maximal sum mutual information (MI) of both the source and relay links, the strongest subchannels of the second-hop channel should be allocated for transmitting signals from the relay node. With additional quality-of-service constraints in terms of the lower bounds of the MI of both links, the optimal subchannel allocation problem is NP-hard. In this case, we propose a suboptimal channel allocation algorithm with a low computational complexity. For a given subchannel allocation, we develop a primal decomposition based algorithm to efficiently solve the power allocation problem. Simulation results show that compared with the exhaustive search based channel allocation approach and the general nonlinear programming based power allocation algorithm, the proposed subchannel and power allocation algorithms have a much lower computational complexity with only a small performance loss. |
| first_indexed | 2025-11-14T10:58:33Z |
| format | Journal Article |
| id | curtin-20.500.11937-73907 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:58:33Z |
| publishDate | 2019 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-739072023-06-06T08:33:04Z Two-Hop AF MIMO Relay System Optimization With Own Information From the Relay Node Su, Q. Rong, Yue In this paper, we consider precoding matrices optimization for a new two-hop amplify-and-forward (AF) multiple-input multiple-output (MIMO) relay system, where in addition to forwarding the source signals, the relay node concurrently transmits its own signals to the destination node. Compared with conventional AF MIMO relay systems where the relay node only forwards the source signals, the transceiver optimization problem in the new system is more challenging to solve. We prove that for all Schur-concave objective functions, the optimal source and relay matrices jointly diagonalize the source-relay-destination and relay-destination channels, which simplifies the matrices optimization problem to a joint subchannel and power allocation problem with scalar variables. It is shown that to achieve a maximal sum mutual information (MI) of both the source and relay links, the strongest subchannels of the second-hop channel should be allocated for transmitting signals from the relay node. With additional quality-of-service constraints in terms of the lower bounds of the MI of both links, the optimal subchannel allocation problem is NP-hard. In this case, we propose a suboptimal channel allocation algorithm with a low computational complexity. For a given subchannel allocation, we develop a primal decomposition based algorithm to efficiently solve the power allocation problem. Simulation results show that compared with the exhaustive search based channel allocation approach and the general nonlinear programming based power allocation algorithm, the proposed subchannel and power allocation algorithms have a much lower computational complexity with only a small performance loss. 2019 Journal Article http://hdl.handle.net/20.500.11937/73907 10.1109/TSP.2018.2885497 http://purl.org/au-research/grants/arc/DP140102131 IEEE fulltext |
| spellingShingle | Su, Q. Rong, Yue Two-Hop AF MIMO Relay System Optimization With Own Information From the Relay Node |
| title | Two-Hop AF MIMO Relay System Optimization With Own Information From the Relay Node |
| title_full | Two-Hop AF MIMO Relay System Optimization With Own Information From the Relay Node |
| title_fullStr | Two-Hop AF MIMO Relay System Optimization With Own Information From the Relay Node |
| title_full_unstemmed | Two-Hop AF MIMO Relay System Optimization With Own Information From the Relay Node |
| title_short | Two-Hop AF MIMO Relay System Optimization With Own Information From the Relay Node |
| title_sort | two-hop af mimo relay system optimization with own information from the relay node |
| url | http://purl.org/au-research/grants/arc/DP140102131 http://hdl.handle.net/20.500.11937/73907 |