Optimal MIMO transmission with per-antenna power constraints

In this paper, three novel efficient power control algorithms are proposed for V-BLAST system with both total power constraint (TPC) and per-antenna power constraints (PAPC). Through analysis of the Karush-Kuhn-Tucker (KKT) conditions of the optimization problem, we find out that the antennas with the optimal power control can be divided into two sets. The optimal allocated power (OAP) of each antenna in the first set is its per-antenna power constraint, and the OAPs of the antennas in the second set can be obtained easily through a new optimization problem with TPC only. Based on the above analysis, three novel efficient power allocation algorithms are developed, which have much lower computational complexities compared with the existing dual update method. Simulation results are presented to demonstrate the efficiency of the proposed power control schemes.

This paper considers the design of hybrid precoders and combiners for mmWave MIMO systems with per-antenna power constraints and the additional limitations introduced by the phase-shifting network in the analog processing stage. Previous hybrid designs were obtained using a total power constraint, but in practical implementations per-antenna constraints are more realistic, specially at mmWave, given the large number of power amplifiers used in the transmit array. Assuming perfect channel knowledge, we obtain first an approximation to the alldigital solution for the precoder and the combiner given the per-antenna constraints. Then, we develop a new method for the design of the hybrid precoder and combiner which attempts to match such all- digital approximation. Simulation results show the effectiveness of the proposed approach, which performs close to the all-digital solution.

This paper investigates a new analog beamforming architecture for massive multiple-input multiple-output (MIMO) systems, where each of the multiple transmit antennas is switched to be on or off to form a beam according to the channel state information at transmitters. This on–off analog beamforming (OABF) scheme has the advantages in terms of both hardware complexities and algorithmic complexities. OABF can completely remove the high-cost, power-consuming, and bulky analog phase shifters that are extensively employed by traditional analog beamforming schemes; it only requires the deployment of low-cost analog switches that are easy to implement. Moreover, we show that the beams formed by such simple antenna on–off switch operations can achieve rather good performances with low-complexity beamforming algorithms. Specifically, we first propose two optimal signal-to-noise ratio maximization algorithms to determine the on–off state of each switch under the per-antenna power constraint and the total power constraint, respectively. After that, we theoretically prove that OABF can achieve the full diversity gain and the full array gain with complexities up to a polynomial order. Numerical results are consistent with our theoretical analysis. We believe that the simple structure of OABF makes massive MIMO much easier to implement in real systems.

In transmit beamforming (BF) systems, one of key issues is how to design an appropriate BF vector to optimize the performance of the whole system. This paper addresses the transmit BF design problem for cyclic prefixed (CP) transmissions over Multiple Input Single Output (MISO) frequency-selective channels under per-antenna power constraints (PPC).In previous studies, several methods have been used to solve this problem, however, all lead to suboptimal solutions. In an attempt to get the optimal solution, we propose an efficient algorithm based on barrier method, which performs closely to the optimal total power constraint (TPC) solution and significantly outperforms the existing PPC solutions. Moreover, the simulation results also show that the proposed algorithm is robust on the different antenna power allocation and antenna number.

We consider the downlink transmission of a wireless communication system where M antennas transmit independent information to a subset of K users, each equipped with a single antenna. The Shannon capacity of this MIMO broadcast channel (MIMO-BC) can be achieved using a non-linear preceding technique known as dirty paper coding (DPC) which is difficult to implement in practice. Motivated to study simpler transmission techniques, we focus on a linear precoding technique based on the zero-forcing (ZF) algorithm. In contrast to the typical sum power constraint (SPC), we consider a per-antenna power constraint (PAPC) motivated both by current antenna array designs where each antenna is powered by a separate amplifier and by future wireless networks where spatially separated antennas transmit cooperatively to users. We show that the problem of power allocation for maximizing the weighted sum rate under ZF with PAPC is a constrained convex optimization problem that can be solved using conventional numerical optimization techniques. For the special case of two users, we find an analytic solution based on waterfilling techniques. For the case where the number of users increases without bound, we show that ZF with PAPC is asymptotically optimal in the sense that the ratio of the expected sum-rate capacities between ZF with PAPC and DPC with SPC approaches one. We also show how the results can be generalized for multiple frequency bands and for a hybrid power constraint. Finally, we provide numerical results that show ZF with PAPC achieves a significant fraction of the optimum DPC sum-rate capacity in practical cases where K is bounded

This paper considers the transmitter optimization problem for a multiuser downlink channel with multiple transmit antennas at the base-station. In contrast to the conventional sum-power constraint on the transmit antennas, this paper adopts a more realistic per-antenna power constraint, because in practical implementations each antenna is equipped with its own power amplifier and is limited individually by the linearity of the amplifier. Assuming perfect channel knowledge at the transmitter, this paper investigates two different transmission schemes under the per-antenna power constraint: a minimum-power beamforming design for downlink channels with a single antenna at each remote user and a capacity-achieving transmitter design for downlink channels with multiple antennas at each remote user. It is shown that in both cases, the per-antenna downlink transmitter optimization problem may be transformed into a dual uplink problem with an uncertain noise. This generalizes previous uplink-downlink duality results and transforms the per-antenna transmitter optimization problem into an equivalent minimax optimization problem. Further, it is shown that various notions of uplink-downlink duality may be unified under a Lagrangian duality framework. This new interpretation of duality gives rise to efficient numerical optimization techniques for solving the downlink per-antenna transmitter optimization problem

We determine the capacity-optimal transmission strategy for a multiple-input-multiple-output (MIMO) Gaussian channel under multiple power constraints, namely joint sum power constraint (SPC), per group power constraints (PGPC), and per antenna power constraints (PAPC). First, we focus on cases where we can analytically determine the optimal transmit strategy under joint SPC-PGPC-PAPC. We obtain results for the following cases: 1) $n_{t} \times 1$ multiple-input-single-output (MISO); 2) MIMO channel with full column rank and full rank optimal covariance matrix; and 3) $2 \times n_{r}$ MIMO channel. These results generalize some recent results for the special cases of PAPC only and joint SPC-PAPC. Then, we propose a projected factored gradient descent (PFGD) algorithm for the general MIMO Gaussian channel under joint SPC-PGPC-PAPC including the possibility of additional rank constraints. This algorithm matches the solution of standard convex optimization tools with lower complexity. The algorithm also overcomes the limitations of existing algorithms, in terms of accuracy and applicability to low rank channels.

A novel unified approach to deal with arbitrary transmitted power constraints for designing jointly the MMSE precoders and decoders in downlink multiuser MIMO systems is developed. This work is an extension of the iterative approach developed in (Jinfan Zhang et al., 2005) for the total power constraint. An explicit expression relating Lagrange multipliers with the per-user constraint can be obtained using the proposed approach to mitigate the time consuming root searching for the Lagrange multipliers in (Jinfan Zhang et al., 2005). Moreover, the explicit expression allows the MMSE solution subject to arbitrary transmit power constraints. In this paper, total, per-user, per-antenna, and peak power constraints are formulated in under the same format and solved using the proposed approach. It is shown in some two-user numerical examples that the raw BER performance obtained from the practical per-antenna power constraint is similar to those of the per-user and total power constraints and is 1-1.5 dB better than that of the peak power constraint.

This paper considers a two user Gaussian multiple-input single-output (MISO) broadcast channel with a per-antenna peak power constraint (or simply peak power constraint). It is more realistic to consider the peak power constraint on each transmit antenna because each antenna is equipped with its own power amplifier in many practical implementations. Assuming the perfect channel state information (CSI) at the transmitter, we propose an achievable scheme using a dirty-tape coding (DTC). The uniform input in a fixed range of the DTC scheme helps to control the peak power of the transmit signal easily. We also present an optimization algorithm that finds the capacity achieving beamforming vectors and power allocations under a per-antenna average power constraint used in our achievable scheme. Simulation results show that as the transmit power increases, the achievable rate region under the peak power constraint is getting close to the capacity region under the reduced per-antenna average power constraint by 1/3. Compared to a non-DTC scheme based on minimum mean square error (MMSE) beamforming, the proposed scheme performs better.

In massive multiple-input multiple-output (MIMO) system, the beam is more directional, and the width becomes narrow as the number of antennas increases. In such case, a moving user equipment (UE) will easily leave the coverage of the beam, causing the existing channel status information (CSI) to be outdated. If the CSI is not updated timely, the transmit rate will degrade due to the absence of accurate CSI. In this paper, we consider a beam control problem. Our proposed algorithm has a with low complexity, which can serve the mobile UE for multiple transmissions by using one beam when CSI feedback is infrequent, thus reducing the overhead of beam adjustment. An optimization problem is formulated that maximizes the sum rate in per-antenna power constraint. Simulation results show that the sum rate of the proposed adaptive beam control scheme outperforms the conventional fixed beamwidth and other simple approaches in per-antenna power constraints.

We propose a semi-closed-form solution to the problem of computing the capacity and optimal signaling for a Gaussian MIMO channel under a joint sum power constraint (SPC) and per-antenna power constraint (PAPC). Existing efficient solutions to this fundamental problem are only applicable to some special cases: multiple-input single-output (MISO) systems, or full column rank MIMO channels with sufficiently high transmit power, or full-rank optimal signaling. For the general case, we present an efficient numerical method to solve the considered problem which does not make any assumptions on the rank of the channel matrix or the maximum transmit power. To achieve this, the considered problem is transformed into an equivalent minimax problem. We then exploit the special structure of the minimax problem to derive a closed-form solution based on a concave-convex procedure (CCP)-like algorithm. Extensive simulation results show that our proposed algorithm outperforms the existing solutions in terms of complexity and generality.

For multiple-input multiple-output (MIMO) transceiver designs, sum power constraint is an elegant and ideal model. When various practical limitations are taken into account e.g., peak power constraints, per-antenna power constraints, etc., covariance shaping constraints will act as an effective and reasonable model. In this paper, we develop a framework for transceiver designs for multi-hop communications under covariance shaping constraints. Particularly, we focus on multi-hop amplify-and-forward (AF) MIMO relaying communications which are recognized as a key enabling technology for device-to-device (D2D) communications for next generation wireless systems such as 5G. The proposed framework includes a broad range of various linear and nonlinear transceiver designs as its special cases. It reveals an interesting fact that the relaying operation in each hop can be understood as a matrix version weighting operation. Furthermore, the nonlinear operations of Tomolision-Harashima Precoding (THP) and Decision Feedback Equalizer (DFE) also belong to the category of this kind of matrix version weighting operation. Furthermore, for both the cases with only pure shaping constraints or joint power constraints, the closed-form optimal solutions have been derived. At the end of this paper, the performance of the various designs is assessed by simulations.

We investigate optimum zero-forcing beamforming in multiple antenna broadcast channels with per-antenna power constraints. We show that standard zero-forcing techniques, such as the Moore-Penrose pseudo-inverse, considered mainly in the context of sum-power constrained systems are suboptimal when there are per-antenna power constraints. We formulate convex optimization problems to find the optimum zero-forcing beamforming vectors. Our results indicate that optimizing the antenna outputs based on the per-antenna constraints may improve the rate considerably when the number of transmit antennas is larger the number of receive antennas. Having more transmit antennas gives rise to additional signal space dimensions that may be exploited effectively to reduce transmit power at particular antennas with limited power budget.

We propose an iterative mode-dropping algorithm that optimizes input signals to achieve the sum capacity of the MIMO-MAC with per-antenna power constraint. The algorithm successively optimizes each user's input covariance matrix by applying mode-dropping to the equivalent single-user MIMO rate maximization problem. Both analysis and simulation show fast convergence. We then use the algorithm to briefly highlight the difference in MIMO-MAC capacities under sum and per-antenna power constraints.

MISO NOMA downlink beamforming optimization with per-antenna power constraints