• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2722-2742
• /
• 2014

We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2616-2635
• /
• 2013

In this paper, we propose an iterative transceiver design in a multi-relay multi-user multiple-input multiple-output (MIMO) system. The design criterion is to minimize sum mean squared error (SMSE) under relay sum power constraint (RSPC) where only local channel state information (CSI)s are available at relays. Local CSI at a relay is defined as the CSI of the channel between BS and the relay in the $1^{st}$ hop link, and the CSI of the channel between the relay and all users in the $2^{nd}$ hop link. Exploiting BS transmitter structure which is concatenated with block diagonalization (BD) precoder, each relay's precoder can be determined using local CSI at the relay. The proposed scheme is based on sequential iteration of two stages; stage 1 determines BS transmitter and relay precoders jointly with SMSE duality, and stage 2 determines user receivers. We verify that the proposed scheme outperforms simple amplify-and-forward (SAF), minimum mean squared error (MMSE) relay, and an existing good scheme of [13] in terms of both SMSE and sum-rate performances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4C
• /
• pp.414-423
• /
• 2009

This paper considers a linear precoding scheme that achieves near optimal sum rate. While the minimum mean square error (MMSE) precoding provides the better MSE performance at all signal-to-noise ratio (SNR) than the zero forcing (ZF) precoding, its sum rate shows superior performance to ZF precoding at low SNR but inferior performance to ZF precoding at high SNR, From this observation, we first propose a near optimal linear precoding scheme in terms of sum rate. The resulting precoding scheme regularizes ZF precoding to maximize the sum rate, resulting in better sum rate performance than both ZF precoding and MMSE precoding at all SNR ranges. To find regularization parameters, we propose a simple algorithm such that locally maximal sum rate is achieved. As a low complexity alternative, we also propose a simple power re-allocation scheme in the conventional regularized channel inversion scheme. Finally, the proposed scheme is tested under the presence of channel estimation error. By simulation, we show that the proposed scheme can maintain the performance gain in the presence of channel estimation error and is robust to the channel estimation error.