Energy Efficient Power Allocation for Multicell Distributed Antenna Systems

In this letter, a multi-cell distributed antenna system (DAS) with multiple users served via linear beamforming in each cell is considered. We focus on joint beamformer optimization (JBO) with the target of system weighted sum capacity maximization based on only partial channel state information at the transmitter (CSIT), which includes instantaneous intra-cell and large-scale inter-cell CSIT. After the formulation of a non-convex JBO problem, an algorithm is proposed to find the globally optimal beamformers based on monotonic optimization and the bisection method. Simulation results are provided to show the superiority of the proposed algorithm and the noticeable performance gain of the JBO based on partial CSIT. The proposed algorithm can be used as a benchmark for low-complexity JBO scheme design for practical applications.

The virtual multiple input multiple output (MIMO) technique can dramatically improve the performance of a multi-cell distributed antenna system (DAS), thanks to its great potentials for inter-cell interference mitigation. One of the most challenging issues for virtual MIMO is the acquisition of channel state information at the transmitter (CSIT), which usually leads to an overwhelming amount of system overhead. In this work, we focus on the case that only the slowly-varying large-scale channel state is required at the transmitter, and explore the performance gain that can be achieved by coordinated transmissions for virtual MIMO with large-scale CSIT. Aiming at maximizing the achievable ergodic sum rate, the input covariances for all the mobile terminals (MTs) are jointly optimized, which turns out to be a complicated non-convex problem with a non-closed-form objective function. Further analysis reveals that the coordinated transmission problem can be recast as a Max-Min problem with a closed-form objective function and linear constraints. Then, by appealing to the successive approximation method and the saddle-point theory of concave-convex functions, we propose an iterative algorithm for coordinated transmissions with large-scale CSIT and establish its convergence. Simulation results corroborate that the proposed scheme converges quickly, and it yields significant performance gains compared to the existing schemes. Moreover, it is observed that the proposed scheme can achieve a nearly globally-optimal point under the diagonal input covariance constraint. Since the acquisition of large-scale CSIT is far less demanding than that of full CSIT, we believe that the proposed coordinated transmissions with large-scale CSIT in DASs shed some light on virtual MIMO in the making.

Coexistence of satellite and terrestrial wireless communication systems in the same frequency band is quite promising for addressing the challenge of spectrum scarcity. To cope with the inevitable inter-system interference, radio resource allocation at both sides should be carefully re-optimized. In this paper, we focus on a scenario where a satellite communication system and a terrestrial distributed antenna system (DAS) coexist via spectrum sharing. We particularly utilize the radio map (RM) to reduce the system overhead for channel acquisition. Based on the large-scale channel state information at the transmitter (CSIT), which is derived from the RM, we propose an optimized power allocation scheme to improve the achievable sum rate of the terrestrial system. For the satellite side, an opportunistic user scheduling scheme is presented, to reduce the harmful leakage interference to the terrestrial mobile users. Simulation results demonstrate that the proposed RM-based coordination scheme can significantly promote the performance of satellite terrestrial coexistence, although the small-scale channel fading has been ignored in the formulated optimization.

In this paper, we analyze optimal (in space and time) adaptive power transmission policies for fading channels when the channel-state information (CSI) at the transmitter (CSIT) and the receiver (CSIR) is available. The transmitter has a long-term (time) average power constraint. There can be multiple antennas at the transmitter and at the receiver. The channel experiences Rayleigh fading. We consider beamforming and space-time coded systems with perfect/imperfect CSIT and CSIR. The performance measure is the bit error rate (BER). We show that in both coded and uncoded systems, our power allocation policy provides exponential diversity order if perfect CSIT is available. We also show that, if the quality of CSIT degrades then the exponential diversity is retained in the low SNR region but we get only polynomial diversity in the high SNR region. Another interesting conclusion is that in case of imperfect CSIT and CSIR, knowledge of CSIT at the receiver is very important. Finally, for the optimal power control policy of the uncoded system we find the error-exponents which provide the rate versus diversity-order tradeoff for this policy. This tradeoff is of an entirely different nature than the well-known Zheng-Tse tradeoff.

We study a practical version of the broadcast channel (BC) where the channel state information at the transmitter (CSIT) is available only for some of the users, dubbing the system as mixed CSIT. We start with the simplest instance of such a heterogeneous BC where a multi-antenna transmitter base-station (BS) is trying to communicate data to two single-antenna user equipments (UE), having the perfect CSIT about UE1 and no CSIT about UE2. We propose a very simple transmission strategy at the BS for such a system and compare its performance with the interference alignment solution proposed elsewhere which achieves full degrees-of-freedom (DOF) when channel coherence lengths and switching instants abide by certain restrictions. Then with an additional receive antenna granted to UE2 (whose CSIT is not available) and keeping the same CSIT perspective, achievable rates for two users are derived and compared with earlier schemes. Analytical and simulation results show that this additional receive antenna brings significant gains in the system with the same transmission strategy and without any extra requirement of channel training or feedback.

Power allocation results for equal-rate systems developed in Part I are extended to multiple-rate systems. For both systems with and without channel state information at the transmitter (CSIT), conditions for the optimality of successive interference cancellation combined with minimum mean square error multiuser detection (SIC+MMSE) are obtained. When CSIT is available, the optimal decoding order is discussed for optimal SIC+MMSE and two sub-optimal decoding schemes. Explicit expressions for the spectral efficiency parameters in the low or high energy regions are also obtained.

Cell densification is a key driver to increase area spectral efficiencies in multi-antenna cellular systems. As increasing the density of base stations (BSs) and users that share the same spectrum, however, both inter-user-interference (IUI) and inter-cell interference (ICI) problems give rise to a significant loss in spectral efficiencies in such systems. To resolve this problem under the constraint of local channel state information per BS, in this paper, we present a novel noncooperative multi-user multiple-input multiple-output (MIMO) precoding technique, called signal-to-interference-pulse-leakage-pulse-noise-ratio (SILNR) maximization precoding. The key innovation of our distributed precoding method is to maximize the product of SILNRs of users per cell using local channel state information at the transmitter (CSIT). We show that our precoding technique only using local CSIT can asymptotically achieve the multi-cell cooperative bound attained by cooperative precoding using global CSIT in some cases. We also present a precoding algorithm that is robust to CSIT errors in multi-cell scenarios. By multi-cell system-level simulations, we demonstrate that our distributed precoding technique outperforms all existing noncooperative precoding methods considerably and can also achieve the multi-cell bound very tightly even with not-so-many antennas at BSs.

In this paper, we consider robust joint linear precoder/receive filter designs for multiuser multi-input multi-output (MIMO) downlink that minimize the sum mean square error (SMSE) in the presence of imperfect channel state information at the transmitter (CSIT). The base station (BS) is equipped with multiple transmit antennas, and each user terminal is equipped with one or more receive antennas. We consider a stochastic error (SE) model and a norm-bounded error (NBE) model for the CSIT error. In the case of CSIT error following SE model, we compute the desired downlink precoder/receive filter matrices by solving the simpler uplink problem by exploiting the uplink-downlink duality for the MSE region. In the case of the CSIT error following the NBE model, we consider the worst-case SMSE as the objective function, and propose an iterative algorithm for the robust transceiver design. The robustness of the proposed algorithms to imperfections in CSIT is illustrated through simulations.

As a key technology for future wireless networks, massive multiple-input multiple-output (MIMO) can significantly improve the energy efficiency (EE) and spectral efficiency (SE), and the performance is highly dependant on the degree of the available channel state information (CSI). While most existing works on massive MIMO focused on the case where the instantaneous CSI at the transmitter (CSIT) is available, it is usually not an easy task to obtain precise instantaneous CSIT. In this paper, we investigate EE-SE tradeoff in single-cell massive MIMO downlink transmission with statistical CSIT. To this end, we aim to optimize the system resource efficiency (RE), which is capable of striking an EE-SE balance. We first figure out a closed-form solution for the eigenvectors of the optimal transmit covariance matrices of different user terminals, which indicates that beam domain is in favor of performing RE optimal transmission in massive MIMO downlink. Based on this insight, the RE optimization precoding design is reduced to a real-valued power allocation problem. Exploiting the techniques of sequential optimization and random matrix theory, we further propose a low-complexity suboptimal two-layer water-filling-structured power allocation algorithm. Numerical results illustrate the effectiveness and near-optimal performance of the proposed statistical CSI aided RE optimization approach.

To satisfy the increasing demands for high data-rate service of high-speed railway (HSR) users on the train, the most promising approach is to utilize the two-hop architecture. With this architecture, large amount of data will be transferred to the access point (AP) at which some data may need to be cached when the train approaches the cell edge. In this paper, an energy-efficiency buffer (EEB) power allocation scheme is proposed, which is able to achieve a high energy efficiency under the requirement of buffer size in HSR scenarios. Firstly, the energy-efficiency optimization problem is formulated as a fractional form. Secondly, this non-convex problem is resolved by transforming it into an equivalent one. Then an iterative power allocation algorithm is proposed and the optimal solution is obtained based on it. Finally, we analyze the effect of cache point on energy efficiency (EE) performance of the proposed EEB power allocation scheme. Furthermore, the relationship between the buffer size and EE performance of HSR communication system is presented. Simulation results suggest that the proposed EEB power allocation scheme can achieve the optimal energy-efficient performance.

In this paper, we study the two-user Gaussian fading Multiple Access Channel (MAC) with cooperative encoders. Two different scenarios are studied: the Gaussian fading MAC with a common message, and the Gaussian fading MAC with conferencing encoders. The throughput capacity region of these channels with partial Channel State Information (CSI) at the transmitters (CSIT) and perfect CSI at the receiver (CSIR) is established. For the Gaussian fading systems with only CSIR (transmitters have no access to CSIT), some numerical examples and simulation results are provided for Rayleigh fading models.

Unlike aerial base station enabled by a single unmanned aerial vehicle (UAV), aerial coordinated multiple points (CoMP) can be enabled by a UAV swarm. In this case, the management of multiple UAVs is important. This paper considers the power allocation strategy for a UAV swarm-enabled aerial network to enhance the physical layer security of the downlink transmission, where an eavesdropper moves following the trajectory of the swarm for better eavesdropping. Unlike existing works, we use only the large-scale channel state information (CSI) and maximize the secrecy throughput in a whole-trajectory-oriented manner. The overall transmission energy constraint on each UAV and the total transmission duration for all the legitimate users are considered. The non-convexity of the formulated problem is solved by using max-min optimization with iteration. Both the transmission power of desired signals and artificial noise (AN) are derived iteratively. Simulation results are presented to validate the effectiveness of our proposed power allocation algorithm and to show the advantage of aerial CoMP by using only the large-scale CSI.

Multiple-input multiple-output (MIMO) systems can be leveraged to increase capacity in fading channels. Especially in multiuser downlink communication systems, it has been shown that knowledge of channel state information at the transmitter (CSIT) is critical to leverage the capacity gain available from multiple antennas. When duplexing is performed using time division, CSIT can often be successfully obtained when channel reciprocity is available. CSIT acquisition, however, is much more difficult in frequency division duplexing. Sending feedback on the uplink has been shown to be a powerful technique to improve downlink performance in single user MIMO systems. The basic idea is to restrict the CSIT to a B bit codebook so that the mobiles can easily transmit these bits on the uplink. In this paper, we consider the multiuser downlink model with unitary precoding when there is a codebook consisting of 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">B</sup> unitary matrices that the precoder is restricted to lie in. This codebook is designed offline and known to both the base-station and all users. Each user sends back signal-to-interference plus noise ratio (SINR) information along with binary feedback about the unitary precoder. Based on the CSIT received on the uplink, the base-station selects one of the unitary matrices in the codebook to maximize the sum-rate. For this set-up, we first analyze the sum-rate performance of the unitary precoding scheme. We then show that the codebook of unitary pre-coders represents a collection of points in a special kind of manifold and show how the achievable sum-rate performance relates to the minimum distance of the codebook points in this space. Finally, we present a framework for constructing the codebook to maximize this minimum distance. Monte Carlo simulation results are presented to show the sum-rate performance of the proposed codebook design.

In recent years, a lot of power allocation algorithms have been proposed to maximize spectral efficiency (SE) and energy efficiency (EE) for the distributed antenna systems (DAS). However, the traditional iterative power allocation algorithms are difficult to be implemented in reality because of their high computational complexity. With the development of machine learning algorithms, it has been proved that the machine learning method has excellent learning ability and low computational complexity, which can approximate the traditional iterative power allocation well and be easily to be implemented in reality. In this paper, we propose a new deep neural network (DNN) model for DAS. From the perspective of machine learning, traditional iterative algorithms can be regarded as a nonlinear mapping between user channel realizations and optimal power allocation schemes. Therefore, we train the DNN to learn the nonlinear mapping between the user channel realizations and the corresponding power allocation schemes based on the traditional iterative algorithm. Then, a power allocation schemes based on DNN method is developed to maximize SE and EE for DAS. The simulation results show that the proposed scheme can not only obtain the almost similar performance as the traditional iterative algorithm, but also reduce much online computational time.

This paper investigates the problem of non-cooperative game theoretic power allocation (NGTPA) for distributed multiple-radar architectures in a spectrum sharing environment, where multiple radars coexist with a communication system in the same frequency band. The primary objective of the multiple-radar system is to minimize the power consumption of each radar by optimizing the transmission power allocation, which is constrained by a predefined signal-to-interference-plus-noise ratio requirement for target detection and a maximum interference tolerant limit for communication system. Since each radar is rational and selfish to maximize its own utility, we utilize the non-cooperative game theoretic technique to tackle the distributed power allocation problem. Taking into consideration the target detection performance and received interference power at the communication receiver, a novel utility function is defined and employed as the optimization criterion for the NGTPA strategy. Furthermore, the existence and uniqueness of the proposed game’s Nash equilibrium point are analytically proved. An iterative power allocation algorithm with low computational complexity and fast convergence is developed, where the optimal value of each radar’s transmission power is simultaneously updated at the same time step. Numerical simulations are provided to verify the analysis and evaluate the performance of the proposed strategy as a function of the system parameters. It is shown that the distributed algorithm is effective for power allocation and could protect the communication system with limited implementation overhead.