scholarly journals Secrecy-Capacity-Optimization-Artificial-Noise in Large-Scale MIMO: Ergodic Lower Bound on Secrecy Capacity and Optimal Power Allocation

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Yebo Gu ◽  
Zhilu Wu ◽  
Zhendong Yin

The security of wireless information transmission in large-scale multi-input and multioutput (MIMO) is the focus of research in wireless communication. Recently, a new artificial noise—SCO-AN which shows no orthogonality to the channel, is proposed to overcome the shortcomings of traditional artificial noise. In the previous research, the optimization function of SCO-AN is not convex, and its extremum cannot be obtained. Usually, nonconvex optimization algorithms or iterative relaxation algorithms are used to get the maximum value of the optimization objective function. Nonconvex optimization algorithms or iterative relaxation algorithms are greatly affected by the initial value, and the extremum cannot be obtained by a nonconvex optimization algorithm or iterative relaxation algorithm. In this paper, we creatively apply the strong law of large numbers to obtain the optimal value of the optimization function of SCO-AN under the condition of large-scale MIMO: the strong law of large numbers is applied to obtain the ergodic lower bound (ELB) expression of SC for SCO-AN. The power allocation (PA) problem of the SCO-AN system is discussed. We use a statistical method to get the formula for calculating the optimal power distribution coefficient of the SCO-AN system. The transmitter can use the optimal power ratio of PA to distribute the transmitted power without using the PA algorithm. The effect of imperfect channel state information is discussed. Through simulation, we found that more power should be generated for SCO-AN if the channel estimation is imperfect and the proposed method can achieve better security performance in the large-scale MIMO system.

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
Xiaochen Ma ◽  
Qunying Wu

In this article, we research some conditions for strong law of large numbers (SLLNs) for weighted sums of extended negatively dependent (END) random variables under sublinear expectation space. Our consequences contain the Kolmogorov strong law of large numbers and the Marcinkiewicz strong law of large numbers for weighted sums of extended negatively dependent random variables. Furthermore, our results extend strong law of large numbers for some sequences of random variables from the traditional probability space to the sublinear expectation space context.


1994 ◽  
Vol 44 (1-2) ◽  
pp. 115-122 ◽  
Author(s):  
Arup Bose ◽  
Tapas K. Chandra

Let { X n} be a sequence of pairwise independent (or -mixing) mean zero random variables such that [Formula: see text] is integrable on (0,∞) and [Formula: see text] then we show that [Formula: see text] almost surely as n→∞, These are very convenient and immediate generalizations of the classical SLLN for the iid case.


Sign in / Sign up

Export Citation Format

Share Document