Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Ergodic Secrecy Capacity of Multiple Input Wiretap Channel with Statistical CSIT

Published 13 Jan 2012 in cs.IT and math.IT | (1201.2868v1)

Abstract: We consider the secure transmission in ergodic fast-Rayleigh fading multiple-input single-output single-antennaeavesdropper (MISOSE) wiretap channels. We assume that the statistics of both the legitimate and eavesdropper channels is the only available channel state information at the transmitter (CSIT). By introducing a new secrecy capacity upper bound, we prove that the secrecy capacity is achieved by Gaussian input without prefixing. To attain this, we form another MISOSE channel for upper-bounding, and tighten the bound by finding the worst correlations between the legitimate and eavesdropper channel coefficients. The resulting upper bound is tighter than the others in the literature which are based on modifying the correlation between the noises at the legitimate receiver and eavesdropper. Next, we fully characterize the ergodic secrecy capacity by showing that the optimal channel input covariance matrix is a scaled identity matrix, with the transmit power allocated uniformly among the antennas. The key to solve such a complicated stochastic optimization problem is by exploiting the completely monotone property of the ergodic secrecy capacity to use the stochastic ordering theory. Finally, our simulation results show that for the considered channel setting, the secrecy capacity is bounded in both the high signal-to-noise ratio and large number of transmit antenna regimes.

Citations (39)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.