Search

This paper investigates nonlinear transceiver design for full-duplex multiple-input multiple-output (FD-MIMO) relay systems. A dual-hop amplify-and-forward relaying protocol is considered. At the destination, nonlinear successive-interference-cancellation (SIC) is used for signal detection. The goal is to find the source and relay precoders such that the symbol-vector error rate (SVER) can be minimized. Due to the loop interference (LI), optimizing the relay precoder in FD systems is much more involved. In this paper, we propose novel designs to solve this problem. Starting from the QR-SIC receiver, we theoretically show that the relay precoder can be solved with a closed-form expression even when the system incurs LI. Then, we consider the system with a minimum mean-squared-error SIC receiver, where the relay precoder design entails a different problem formulation and introduces new challenges. We propose a novel iterative method, with closed-form solutions in each iteration, to solve this problem. Simulations show that our designs can significantly improve the SVER performance for FD-MIMO relay systems. [ABSTRACT FROM AUTHOR]

We consider joint source/relay precoding in three-node two-hop amplify-and-forward (AF) multiple-input–multiple-output (MIMO) relay systems. In our systems, linear precoders are used at the source and the relay, and the QR successive interference cancelation (SIC) receiver is used at the destination. Our design criterion is to minimize the block error rate (BLER) of the receiver. Since the BLER is a complicated function of the source and relay precoders, and the power constraints are coupled, the optimization problem is difficult to solve. To overcome the difficulty, we first apply the primal decomposition approach, transforming the original optimization to a subproblem and a master problem. In the subproblem, the optimum source precoder can be obtained with the geometric mean decomposition (GMD). In the master problem, however, the optimum relay precoder cannot be straightforwardly obtained. We theoretically prove that the optimum relay precoder exhibits a matrix diagonalization property. Using this property, we can then transform the master problem into a scalar-variable concave optimization problem. A closed-form solution can be derived by the Karuch–Kuhn–Tucker (KKT) conditions. Finally, we extend our method to the two-hop AF MIMO relay system with the minimum mean square error (MMSE) SIC receiver. Assuming a unitary source precoder, we obtain the optimum source and relay precoders in closed form. Simulations show that the proposed transceivers can significantly improve the system performance. [ABSTRACT FROM PUBLISHER]

In this paper, we propose cognitive overlay transceiver designs, where a primary transceiver pair and a secondary transceiver pair coexist in a network, and the primary user (PU) allows the secondary user (SU) to concurrently transmit its signals at the price of reducing the power of the PU's signal relayed by cooperative amplify-and-forward (AF). Since the considered transceiver design is mainly to devise the precoders both for the PU and the SU at the secondary transmitter (ST), the channel state information (CSI) has to be known at the ST. We therefore consider the limited feedback scheme with random vector quantization (RVQ), where the ST can only know the quantized channel direction information (CDI). Considering the statistics of the CSI quantization error and the linear minimum mean square error (LMMSE) receiver, we derive the closed-form MSE expressions corresponding to the PU and the SU. With the derived MSEs, we propose two robust design criteria. One criterion is to minimize the ST's power consumption under the constraint that the PU's and SU's quality-of-service (QoS; i.e., MSE) can be met. The other criterion is to minimize the SU's MSE when the PU's QoS can be controlled under a certain value and the ST satisfies the limitation of its transmission power consumption. Both the optimization problems of the proposed design criteria are not convex, and the corresponding solutions cannot be directly obtained. We then propose transfering the original optimization problems into two subproblems, where each of them is eventually formulated as a convex optimization problem, and the solutions are iteratively obtained, which is effective. Thus, the results can be obtained with the interior-point method. Simulations certify the robustness of our designs. [ABSTRACT FROM PUBLISHER]

We consider the precoding problem in an amplifyand-forward (AF) multiple-input-multiple-output (MIMO) relay system in which multiple antennas are equipped at the source, the relay, and the destination. Most existing methods for this problem only consider the design of the relay precoder, and some even ignore the direct link. In this paper, we consider a joint source/relay precoder design problem, taking both the direct and the relay links into account. Using a minimum-mean-square-error (MMSE) criterion, we first formulate the problem as a constrained optimization problem. However, it is found that the mean square error (MSE) is a highly nonlinear function of the precoders, and a direct optimization is difficult to conduct. We then design the precoders to diagonalize the MSE matrix in the cost function. To do that, we pose certain structural constraints on the precoders and derive an MSE upper bound. It turns out that minimization with respect to this bound becomes simple and straightforward. Using the standard Lagrange technique, we can finally obtain the solution with an iterative water-filling method. Simulation results show that the proposed method, with an additional precoder, outperforms the existing methods, in terms of either the MSE or the bit error rate (BER). [ABSTRACT FROM AUTHOR]