Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Gaussian signalling for covert communications

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

In this paper, we examine the optimality of Gaussian signalling for covert communications with an upper bound on D(p1||p0) or D(p0||p1) as the covertness constraint, where D(p1||p0) and D(p0||p1) are different due to the asymmetry of Kullback-Leibler divergence, p0(y) and p1(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 the Gaussian signalling is optimal in terms of maximizing the mutual information of transmitted and received signals for covert communications with an upper bound on D(p1||p0) as the constraint. More interestingly, we also prove that the Gaussian signalling is not optimal for covert communications with an upper bound on D(p0||p1) as the constraint, for which as we explicitly show skew-normal signalling can outperform the Gaussian signalling in terms of achieving higher mutual information. Finally, we prove that, for Gaussian signalling, an upper bound on D(p1||p0) is a tighter covertness constraint in that it leads to lower mutual information than the same upper bound on D(p0||p1) , by proving D(p0||p1) ≤ D(p1||p0).

Description

Citation

Source

IEEE Transactions on Wireless Communications

Book Title

Entity type

Access Statement

License Rights

Restricted until