Search

Spatial diversity is an effective method to mitigate the effects of fading, and when used in conjunction with low-density parity-check (LDPC) codes, it can achieve excellent error-correcting performance. Noise added at each branch of the diversity combiner is generally assumed to be additive white Gaussian noise, but there are many applications where the received signal is impaired by noise with a non-Gaussian distribution. In this paper, we derive the exact bit-error probability of different linear combining techniques on Rayleigh fading channels with impulsive noise, which is modeled using symmetric alpha-stable distributions. The relationship for the signal-to-noise ratios of these linear combiners is derived and then different non-linear detectors are presented. A detector based on the bi-parameter Cauchy–Gaussian mixture model is used and shows near-optimal performance with a significant reduction in complexity when compared with the optimal detector. Furthermore, the threshold signal-to-noise ratio of LDPC codes for different combining techniques on these channels is derived using density evolution and an estimation of the waterfall performance of LDPC codes is derived that reduces the gap between simulated and asymptotic performance. [ABSTRACT FROM AUTHOR]

This paper investigates simultaneous wireless information and power transfer (SWIPT) for a multiple-input–single-output (MISO) secrecy channel. First, transmit beamforming without artificial noise (AN) is designed to achieve the secrecy rate maximization problem subject to the transmit power and the energy harvesting (EH) constraints. This problem is not convex, but this can be solved by applying a bisection search to a sequence of the associated power minimization problems, each of which can be solved by using a novel relaxation approach. Moreover, we extend our proposed algorithms to the robust case by incorporating channel uncertainties. Then, transmit beamforming with AN is investigated for the secrecy rate maximization problem, where two relaxation approaches are presented, i.e., a two-level optimization algorithm and a successive convex approximation (SCA), to solve the secrecy rate maximization problem. In addition, tightness analyses of rank relaxation are provided to show that the optimal transmit covariance matrix exactly returns rank one. Simulation results are provided to validate the performance of the proposed algorithms. [ABSTRACT FROM PUBLISHER]

In this paper, we study different secrecy rate optimization techniques for a multiple-input–multiple-output (MIMO) secrecy channel, where a multiantenna cooperative jammer is employed to improve secret communication in the presence of a multiantenna eavesdropper. Specifically, we consider two optimization problems, namely, power minimization and secrecy rate maximization. These problems are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To circumvent these nonconvexity issues, we alternatively design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. For a given transmit covariance matrix at the cooperative jammer, we solve the power minimization and secrecy rate maximization problems based on a Taylor series expansion. Then, we propose two iterative algorithms to solve these approximated problems. In addition, we develop a robust scheme by incorporating channel uncertainties associated with the eavesdropper. By exploiting S-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming. Moreover, we consider the secrecy rate maximization problem based on game theory, where the jammer introduces charges for its jamming service based on the amount of the interference caused to the eavesdropper. This secrecy rate maximization problem is formulated into a Stackelberg game where the jammer and the transmitter are the leader and the follower of the game, respectively. For the proposed game, Stackelberg equilibrium is analytically derived. Simulation results have been provided to validate the convergence and performance of the proposed algorithms. In addition, it is shown that the proposed robust scheme outperforms the nonrobust scheme in terms of the achieved secrecy rate and the worst-case secrecy rate. Finally, the Stackelberg equilibrium solution has been validated through numerical results. [ABSTRACT FROM PUBLISHER]