pith. sign in

arxiv: 1010.1163 · v1 · pith:TRQAGVQDnew · submitted 2010-10-06 · 💻 cs.IT · math.IT

Secrecy Capacity of the Gaussian Wire-Tap Channel with Finite Complex Constellation Input

classification 💻 cs.IT math.IT
keywords capacitysecrecyfinitechannelconstellationcurvesgaussianinput
0
0 comments X
read the original abstract

The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a fixed noise variance of the eavesdropper's channel has a global maximum at an internal point. This is in contrast to what is known in the case of Gaussian codebook input where the secrecy capacity curve is a bounded, monotonically increasing function of SNR. Secrecy capacity curves for some well known constellations like BPSK, 4-QAM, 16-QAM and 8-PSK are plotted and the SNR at which the maximum occurs is found through simulation. It is conjectured that the secrecy capacity curves for finite constellations have a single maximum.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.