Zhongyong Wang

Outage Constrained Robust Beamforming for Secure Broadcasting Systems With Energy Harvesting

In this paper, we investigate simultaneous wireless information and power transfer systems for multiuser multiple-input single-output secure broadcasting channels. Considering imperfect channel state information, we introduce a robust secure beamforming design, where the transmit power is minimized subject to the secrecy rate outage probability constraint for legitimate users and the harvested energy outage probability constraint for energy harvesting receivers. The original problem is non-convex due to the presence of the probabilistic constraints. With the aid of Bernstein-type inequalities, we transform the outage constraints into the deterministic forms. Based on a successive convex approximation (SCA) method, we propose a low-complexity approach, which reformulates the original problem as a second-order cone programming problem. Also, we prove the convergence of the SCA-based iterative algorithm. Simulation shows that the proposed scheme outperforms the conventional method with lower complexity.

Robust Beamforming and Power Splitting Design in Distributed Antenna System with SWIPT under Bounded Channel Uncertainty

In this paper, we investigate a multiuser downlink distributed antenna system with simultaneous wireless information and power transmission under the assumption of imperfect channel state information at the distributed antenna (DA) port. To optimally design robust transmit beamforming vectors and receive power splitting factors, our design objective is to maximize the average worst-case signal-to-interference-plus-noise ratio while simultaneously achieving the individual energy harvesting (EH) constraint for each user and the per-DA port power constraint. We solve this non- convex problem by reformulating it into a two-stage problem. Simulation results are shown to validate the robustness and effectiveness of the proposed algorithms.

Iterative Receiver Design for ISI Channels Using Combined Belief- and Expectation-Propagation

In this letter, a message-passing algorithm that combines belief propagation and expectation propagation is applied to design an iterative receiver for intersymbol interference channels. We detail the derivation of the messages passed along the nodes of a vector-form factor graph representing the underlying probabilistic model. We also present a simple but efficient method to cope with the “negative variance” problem of expectation propagation. Simulation results show that the proposed algorithm outperforms, in terms of bit-error-rate and convergence rate, a LMMSE turbo-equalizer based on Gaussian message passing with the same order of computational complexity.

Robust transceiver designs in multiuser MISO broadcasting with simultaneous wireless information and power transmission

In this paper, we address a new robust optimization problem in a multiuser multiple-input single-output broadcasting system with simultaneous wireless information and power transmission, where a multi-antenna base station (BS) sends energy and information simultaneously to multiple users equipped with a single antenna. Assuming that perfect channel-state information (CSI) for all channels is not available at the BS, the uncertainty of the CSI is modeled by an Euclidean ball-shaped uncertainty set. To optimally design transmit beamforming weights and receive power splitting, an average total transmit power minimization problem is investigated subject to the individual harvested power constraint and the received signal-to-interference-plus-noise ratio constraint at each user. Due to the channel uncertainty, the original problem becomes a homogeneous quadratically constrained quadratic problem, which is NP-hard. The original design problem is reformulated to a relaxed semidefinite program, and then two different approaches based on convex programming are proposed, which can be solved efficiently by the interior point algorithm. Numerical results are provided to validate the robustness of the proposed algorithms.

Joint optimization of AN-aided beamforming and power splitting designs for MISO secrecy channel with SWIPT

In this paper, we study an energy harvesting scheme for a multiple-input-single-output secrecy channel under imperfect channel state information case with either deterministic and statistical channel uncertainties. The system consists of one multi-antenna transmitter, several multi-antenna energy receivers (ERs) and one single-antenna co-located receiver (CR) who adopts a power splitter to decode information and harvest power simultaneously. We consider the artificial noise (AN) embedded information-bearing signal to interfere potential eavesdroppers (i.e., ERs) and capture the harvested power. We perform joint optimization for the masked beamforming matrix, the AN covariance matrix and the power splitting ratio, such that the transmit power is minimized to satisfy the target secrecy rate of the CR, the total transmit power and the energy harvesting constraints for the CR and the ERs. By incorporating norm-bounded channel uncertainty model, we propose a robust joint design method to obtain the optimal solution. Also, a suboptimal algorithm for the outage constrained robust optimization problem is proposed by adopting the Bernstein-type inequality. Furthermore, the tightness of the relaxation for the proposed schemes are verified by showing that the optimal solution of the relaxed problem is rank-one. Finally, simulation results are presented to validate the performance of our proposed schemes.

Robust beamforming based on transmit power analysis for multiuser multiple-input–single-output interference channels with energy harvesting

In this study, the authors study the robust transmit beamforming and receive power splitting design for simultaneous wireless information and power transfer in multiuser multiple-input–single-output interference channel with imperfect channel-state information at the transmitter. Following the worst-case model, they minimise the average total transmit power subject to a set of energy harvesting constraints and signal-to-interference-and-noise ratio constraints. On the basis of the Lagrangian multiplier method, they propose a robust design method based on tight bounds that is able to achieve an approximate optimum. To reduce the complexity, they transform this original problem into a relaxed semi-definite programming problem based on loose bounds, which can be solved efficiently. It is shown from simulation results that their proposed methods outperform the non-robust scheme.

Robust Beamforming Design for MISO Secrecy Multicasting Systems with Energy Harvesting

In this paper, we study simultaneous wireless information and power transfer (SWIPT) for multiuser multiple-input- single-output (MISO) secrecy multicasting channels with imperfect channel state information. First, a robust secure beamfoming design is considered, where the transmit power is minimized subject to the secrecy rate outage probability constraint for legitimate users and the harvested energy outage probability constraint for energy harvesting receivers. The original problem is non-convex due to the presence of the probabilistic constraints. By utilizing Bernstein-type inequalities, we transform the outage constraints into the deterministic forms. In order to identify a local optimal rank-one solution, we propose an efficient approach based on a constrained concave convex procedure method to convert the original problem into a sequence of convex programming problems. Finally, simulation results are provided to validate the performance of our proposed design methods.

Robust beamforming design for multiple-input–single-output secrecy multicasting systems with simultaneous wireless information and power transmission

In this study, the authors study simultaneous wireless information and power transfer for multiuser multiple-input–single-output secure multicasting channels with imperfect channel state information. First, a robust secure beamforming design is considered, where the transmit power is minimised subject to the secrecy rate outage probability constraint for legitimate users and the harvested energy outage probability constraint for energy harvesting receivers. The original problem is non-convex due to the presence of the probabilistic constraints. By utilising Bernstein-type inequalities, the authors transform the outage constraints into the deterministic forms. In order to identify a local optimal rank-one solution, the authors propose an efficient approach based on a constrained concave convex procedure method to convert the original problem into a sequence of convex programming problems. Finally, simulation results are provided to validate the performance of the proposed design methods.

A low complexity OFDM receiver with combined GAMP and MF message passing

With a unified belief propagation (BP) and mean field (MF) framework, we propose an iterative message passing receiver, which performs joint channel state and noise precision (the reciprocal of noise variance) estimation and decoding for OFDM systems. The recently developed generalized approximate message passing (GAMP) is incorporated to the BP–MF framework, where MF is used to handle observation factor nodes with unknown noise precision and GAMP is used for channel estimation in the time–frequency domain. Compared to state-of-the-art algorithms in the literature, the proposed algorithm either delivers similar performance with much lower complexity, or delivers much better performance with similar complexity. In addition, the proposed algorithm exhibits fastest convergence.

Secure Beamforming Designs for Secrecy MIMO SWIPT Systems

In this letter, secure beamforming designs are investigated in a multiple-input multiple-output secrecy channels with simultaneous wireless information and power transfer. In order to achieve fairness among different multiple energy harvesting receivers, the minimum harvested energy is maximized under the secrecy rate requirements. In particular, in order to reduce the computational complexity of the semidefinite programming problem, a successive convex approximation (SCA) iterative algorithm is proposed in the perfect channel state information (CSI) case to obtain a near-optimal rank-one solution. Moreover, the original problem is extended to the imperfect CSI case by incorporating a norm-bounded error model, where an SCA-based iterative algorithm is also proposed. Simulation results reveal that the SCA-based iterative algorithm achieves the same performance as the semidefinite relaxation method with reduced complexity.