Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Ergodic Secrecy Capacity for Gaussian MISO Wiretap Channels (1003.2372v1)

Published 11 Mar 2010 in cs.IT and math.IT

Abstract: A Gaussian multiple-input single-output (MISO) wiretap channel model is considered, where there exists a transmitter equipped with multiple antennas, a legitimate receiver and an eavesdropper each equipped with a single antenna. We study the problem of finding the optimal input covariance that achieves ergodic secrecy capacity subject to a power constraint where only statistical information about the eavesdropper channel is available at the transmitter. This is a non-convex optimization problem that is in general difficult to solve. Existing results address the case in which the eavesdropper or/and legitimate channels have independent and identically distributed Gaussian entries with zero-mean and unit-variance, i.e., the channels have trivial covariances. This paper addresses the general case where eavesdropper and legitimate channels have nontrivial covariances. A set of equations describing the optimal input covariance matrix are proposed along with an algorithm to obtain the solution. Based on this framework, we show that when full information on the legitimate channel is available to the transmitter, the optimal input covariance has always rank one. We also show that when only statistical information on the legitimate channel is available to the transmitter, the legitimate channel has some general non-trivial covariance, and the eavesdropper channel has trivial covariance, the optimal input covariance has the same eigenvectors as the legitimate channel covariance. Numerical results are presented to illustrate the algorithm.

Citations (7)

Summary

We haven't generated a summary for this paper yet.