An intelligent reflecting surface (IRS) is invoked for enhancing the energy harvesting performance of a simultaneous wireless information and power transfer (SWIPT) aided system. Specifically, an IRS-assisted SWIPT system is considered, where a multi-antenna aided base station (BS) communicates with several multi-antenna assisted information receivers (IRs), while guaranteeing the energy harvesting requirement of the energy receivers (ERs). To maximize the weighted sum rate (WSR) of IRs, the transmit precoding (TPC) matrices of the BS and passive phase shift matrix of the IRS should be jointly optimized. To tackle this challenging optimization problem, we first adopt the classic block coordinate descent (BCD) algorithm for decoupling the original optimization problem into several subproblems and alternately optimize the TPC matrices and the phase shift matrix. For each subproblem, we provide a low-complexity iterative algorithm, which is guaranteed to converge to the Karush-Kuhn-Tucker (KKT) point of each subproblem. The BCD algorithm is rigorously proved to converge to the KKT point of the original problem. We also conceive a feasibility checking method to study its feasibility. Our extensive simulation results confirm that employing IRSs in SWIPT beneficially enhances the system performance and the proposed BCD algorithm converges rapidly, which is appealing for practical applications.

Reconfigurable intelligent surfaces (RISs) or intelligent reflecting surfaces (IRSs), are regarded as one of the most promising and revolutionizing techniques for enhancing the spectrum and/or energy efficiency of wireless systems. These devices are capable of reconfiguring the wireless propagation environment by carefully tuning the phase shifts of a large number of low-cost passive reflecting elements. In this article, we aim for answering four fundmental questions: 1) Why do we need RISs? 2) What is an RIS? 3) What are RIS's applications? 4) What are the relevant challenges and future research directions? In response, eight promising research directions are pointed out.

Beamforming is an effective means to improve the quality of the received signals in multiuser multiple-input-singleoutput (MISO) systems. This paper studies fast optimal downlink beamforming strategies by leveraging the powerful deep learning techniques. Traditionally, finding the optimal beamforming solution relies on iterative algorithms which leads to high computational delay and is thus not suitable for real-time implementation. In this paper, we propose a deep learning framework for the optimization of downlink beamforming. In particular, the solution is obtained based on convolutional neural networks and exploitation of expert knowledge, such as the uplink-downlink duality and the structure of known optimal solutions. Using this framework, we construct three beamforming neural networks (BNNs) for three typical optimization problems, i.e., the signalto-interference-plus-noise ratio (SINR) balancing problem, the power minimization problem and the sum rate maximization problem. The BNNs for the former two problems adopt the supervised learning approach, while the BNN for the sum rate maximization problem employs a hybrid method of supervised and unsupervised learning to improve the performance beyond the state of the art. Simulation results show that with much reduced computational complexity, the BNNs can achieve nearoptimal solutions to the SINR balancing and power minimization problems, and outperform the existing algorithms that maximize the sum rate. In summary, this work paves the way for fast realization of the optimal beamforming in multiuser MISO systems.Index Terms-Deep learning, beamforming, MISO, beamforming neural network.

No abstract

No abstract

No abstract

The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record.

This paper jointly optimizes the precoding matrices and the set of active remote radio heads (RRHs) to minimize the network power consumption (NPC) for a user-centric cloud radio access network (C-RAN), where both the RRHs and users have multiple antennas and each user is served by its nearby RRHs. Both users' rate requirements and per-RRH power constraints are considered. Due to these conflicting constraints, this optimization problem may be infeasible. In this paper, we propose to solve this problem in two stages. In Stage I, a low-complexity user selection algorithm is proposed to find the largest subset of feasible users. In Stage II, a low-complexity algorithm is proposed to solve the optimization problem with the users selected from Stage I. Specifically, the re-weighted l 1 -norm minimization method is used to transform the original problem with non-smooth objective function into a series of weighted power minimization (WPM) problems, each of which can be solved by the weighted minimum mean square error (WMMSE) method. The solution obtained by the WMMSE method is proved to satisfy the Karush-Kuhn-Tucker (KKT) conditions of the WPM problem. Moreover, a lowcomplexity algorithm based on Newton's method and the gradient descent method is developed to update the precoder matrices in each iteration of the WMMSE method. Simulation results demonstrate the rapid convergence of the proposed algorithms and the benefits of equipping multiple antennas at the user side.Moreover, the proposed algorithm is shown to achieve near-optimal performance in terms of NPC.find the optimal solution. Although these two approaches yield the optimal solution, they have an exponential complexity. The third approach is the smooth function method, where the l 0norm was approximated as Gaussian-like function in [19], the exponential function in [20], and arctangent function in [21]. However, the smooth function cannot produce sparse solutions in general. The last approach was inspired by the compression sensing, named re-weighted l 1 -norm minimization method [27]. This method has been widely adopted in the literature [22]-[26], [28] due to its low computational complexity and sparsity guarantee, which will also be applied in this paper.All of the above papers only considered the single-antenna user (SAU) case. With the increasing development in antenna technology [29], [30], it is possible to equip the wireless devices with multiple antennas. When both the transmitter and the receiver are equipped with multiple antennas, multiple streams can be transmitted simultaneously, rather than only one stream in the SAU case. Simulation results show that with the increasing number of receive antennas, more users can be admitted. Therefore, in this paper, we consider the multiple-antenna user (MAU) case and jointly optimize the precoding matrices and the set of active RRHs to minimize the NPC subject to users' rate requirements and per-RRH power constraints.Unfortunately, the techniques in [16]-[26] dealing with the SAU case cannot be extended d...