Gaussian Signalling for Covert Communications

07/02/2018
by   Shihao Yan, et al.
0

In this work, we examine the optimality of Gaussian signalling for covert communications with an upper bound on D(p__1(y)||p__0(y)) or D(p__0(y)||p__1(y)) as the covert communication constraint, where D(p__1(y)||p__0(y)) and D(p__0(y)||p__1(y)) are different due to the asymmetry of Kullback-Leibler divergence, p__0(y) and p__1(y) are the likelihood functions of the observation y at the warden under the null hypothesis (no covert transmission) and alternative hypothesis (a covert transmission occurs), respectively. Considering additive white Gaussian noise at both the receiver and the warden, we prove that Gaussian signalling is optimal in terms of maximizing the mutual information of transmitted and received signals for covert communications with D(p__1(y)||p__0(y)) ≤ 2ϵ^2 as the constraint. More interestingly, we also prove that Gaussian signalling is not optimal for covert communications with an upper bound on D(p__0(y)||p__1(y)) as the constraint, for which as we explicitly show a skew-normal signalling can outperform Gaussian signalling in terms of achieving higher mutual information. Finally, we prove that, for Gaussian signalling, an upper bound on D(p__1(y)||p__0(y)) is a tighter constraint in terms of leading to lower mutual information than the same upper bound on D(p__0(y)||p__1(y)), by proving D(p__0(y)||p__1(y)) ≤D(p__1(y)||p__0(y)).

READ FULL TEXT

page 1

page 2

page 3

page 5

page 9

research
12/04/2018

A Tight Upper Bound on Mutual Information

We derive a tight lower bound on equivocation (conditional entropy), or ...
research
05/29/2023

The First and Second Order Asymptotics of Covert Communication over AWGN Channels

This paper investigates the asymptotics of the maximal throughput of com...
research
03/21/2019

Decomposing information into copying versus transformation

In many real-world systems, information can be transmitted in two qualit...
research
05/24/2021

A Practical Consideration on Convex Mutual Information

In this paper, we focus on the convex mutual information, which was foun...
research
06/22/2020

CLUB: A Contrastive Log-ratio Upper Bound of Mutual Information

Mutual information (MI) minimization has gained considerable interests i...
research
05/15/2020

How to Make 5G Communications "Invisible": Adversarial Machine Learning for Wireless Privacy

We consider the problem of hiding wireless communications from an eavesd...
research
12/15/2019

Relaxed Wyner's Common Information

A natural relaxation of Wyner's Common Information is studied. Specifica...

Please sign up or login with your details

Forgot password? Click here to reset