In this paper, we focus on the cancellation of interference among Destination Users (DU's) and the improvement of achievable sum rate of the nonregenerative multiuser Multiple-Input Multiple-Output (MIMO) relay downlink system. A novel design method of transmit weight is proposed to successively eliminate the interference among DU's, each of which is equipped with multiple receive antennas. We firstly investigate the transmit weight design for the Amplify-and-Forward (AF) relay scheme where the Relay Station (RS) just retransmits the received signals from Base Station (BS), then extend it to the joint design scheme of transmit weights at the both BS and RS. In the proposed joint design scheme, through the comparison of lower bound of achievable rate, an effective DU selection algorithm is proposed to generate the transmit weight at the RS and obtain the multiuser diversity. Dirty Paper Coding (DPC) technique is employed to remove the interference among DU's and ensures the achievable rate of downlink. Theoretical derivation and simulation results demonstrate the effectiveness of the proposed scheme in obtaining the achievable rate performance and BER characteristics.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Cong LI, Yasunori IWANAMI, Ryota YAMADA, Naoki OKAMOTO, "Effective Design of Transmit Weights for Nonregenerative Multiuser MIMO Relay Downlink System" in IEICE TRANSACTIONS on Fundamentals,
vol. E95-A, no. 11, pp. 1894-1903, November 2012, doi: 10.1587/transfun.E95.A.1894.
Abstract: In this paper, we focus on the cancellation of interference among Destination Users (DU's) and the improvement of achievable sum rate of the nonregenerative multiuser Multiple-Input Multiple-Output (MIMO) relay downlink system. A novel design method of transmit weight is proposed to successively eliminate the interference among DU's, each of which is equipped with multiple receive antennas. We firstly investigate the transmit weight design for the Amplify-and-Forward (AF) relay scheme where the Relay Station (RS) just retransmits the received signals from Base Station (BS), then extend it to the joint design scheme of transmit weights at the both BS and RS. In the proposed joint design scheme, through the comparison of lower bound of achievable rate, an effective DU selection algorithm is proposed to generate the transmit weight at the RS and obtain the multiuser diversity. Dirty Paper Coding (DPC) technique is employed to remove the interference among DU's and ensures the achievable rate of downlink. Theoretical derivation and simulation results demonstrate the effectiveness of the proposed scheme in obtaining the achievable rate performance and BER characteristics.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E95.A.1894/_p
Copy
@ARTICLE{e95-a_11_1894,
author={Cong LI, Yasunori IWANAMI, Ryota YAMADA, Naoki OKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Effective Design of Transmit Weights for Nonregenerative Multiuser MIMO Relay Downlink System},
year={2012},
volume={E95-A},
number={11},
pages={1894-1903},
abstract={In this paper, we focus on the cancellation of interference among Destination Users (DU's) and the improvement of achievable sum rate of the nonregenerative multiuser Multiple-Input Multiple-Output (MIMO) relay downlink system. A novel design method of transmit weight is proposed to successively eliminate the interference among DU's, each of which is equipped with multiple receive antennas. We firstly investigate the transmit weight design for the Amplify-and-Forward (AF) relay scheme where the Relay Station (RS) just retransmits the received signals from Base Station (BS), then extend it to the joint design scheme of transmit weights at the both BS and RS. In the proposed joint design scheme, through the comparison of lower bound of achievable rate, an effective DU selection algorithm is proposed to generate the transmit weight at the RS and obtain the multiuser diversity. Dirty Paper Coding (DPC) technique is employed to remove the interference among DU's and ensures the achievable rate of downlink. Theoretical derivation and simulation results demonstrate the effectiveness of the proposed scheme in obtaining the achievable rate performance and BER characteristics.},
keywords={},
doi={10.1587/transfun.E95.A.1894},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Effective Design of Transmit Weights for Nonregenerative Multiuser MIMO Relay Downlink System
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1894
EP - 1903
AU - Cong LI
AU - Yasunori IWANAMI
AU - Ryota YAMADA
AU - Naoki OKAMOTO
PY - 2012
DO - 10.1587/transfun.E95.A.1894
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E95-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2012
AB - In this paper, we focus on the cancellation of interference among Destination Users (DU's) and the improvement of achievable sum rate of the nonregenerative multiuser Multiple-Input Multiple-Output (MIMO) relay downlink system. A novel design method of transmit weight is proposed to successively eliminate the interference among DU's, each of which is equipped with multiple receive antennas. We firstly investigate the transmit weight design for the Amplify-and-Forward (AF) relay scheme where the Relay Station (RS) just retransmits the received signals from Base Station (BS), then extend it to the joint design scheme of transmit weights at the both BS and RS. In the proposed joint design scheme, through the comparison of lower bound of achievable rate, an effective DU selection algorithm is proposed to generate the transmit weight at the RS and obtain the multiuser diversity. Dirty Paper Coding (DPC) technique is employed to remove the interference among DU's and ensures the achievable rate of downlink. Theoretical derivation and simulation results demonstrate the effectiveness of the proposed scheme in obtaining the achievable rate performance and BER characteristics.
ER -