The First and Second-Order Asymptotics of Covert Communication over AWGN Channels
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918430190338048 |
|---|---|
| author | Yu, Xinchun Wei, Shuangqing Huang, Shao-Lun Zhang, Xiao-Ping |
| author_facet | Yu, Xinchun Wei, Shuangqing Huang, Shao-Lun Zhang, Xiao-Ping |
| contents | This paper investigates the asymptotics of the maximal throughput of communication over AWGN channels by $n$ channel uses under a covert constraint in terms of an upper bound $δ$ of Kullback-Leibler divergence (KL divergence). It is shown that the first and second order asymptotics of the maximal throughput are $\sqrt{nδ\log e}$ and $(2)^{1/2}(nδ)^{1/4}(\log e)^{3/4}\cdot Q^{-1}(ε)$, respectively. The technique we use in the achievability is quasi-$\varepsilon$-neighborhood notion from information geometry. For finite blocklength $n$, the generating distributions are chosen to be a family of truncated Gaussian distributions with decreasing variances. The law of decreasing is carefully designed so that it maximizes the throughput at the main channel in the asymptotic sense under the condition that the output distributions satisfy the covert constraint. For the converse, the optimality of Gaussian distribution for minimizing KL divergence under the second order moment constraint is extended from dimension $1$ to dimension $n$. Based on that, we establish an upper bound on the average power of the code to satisfy the covert constraint, which further leads to the direct converse bound in terms of covert metric. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_17924 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | The First and Second-Order Asymptotics of Covert Communication over AWGN Channels Yu, Xinchun Wei, Shuangqing Huang, Shao-Lun Zhang, Xiao-Ping Information Theory This paper investigates the asymptotics of the maximal throughput of communication over AWGN channels by $n$ channel uses under a covert constraint in terms of an upper bound $δ$ of Kullback-Leibler divergence (KL divergence). It is shown that the first and second order asymptotics of the maximal throughput are $\sqrt{nδ\log e}$ and $(2)^{1/2}(nδ)^{1/4}(\log e)^{3/4}\cdot Q^{-1}(ε)$, respectively. The technique we use in the achievability is quasi-$\varepsilon$-neighborhood notion from information geometry. For finite blocklength $n$, the generating distributions are chosen to be a family of truncated Gaussian distributions with decreasing variances. The law of decreasing is carefully designed so that it maximizes the throughput at the main channel in the asymptotic sense under the condition that the output distributions satisfy the covert constraint. For the converse, the optimality of Gaussian distribution for minimizing KL divergence under the second order moment constraint is extended from dimension $1$ to dimension $n$. Based on that, we establish an upper bound on the average power of the code to satisfy the covert constraint, which further leads to the direct converse bound in terms of covert metric. |
| title | The First and Second-Order Asymptotics of Covert Communication over AWGN Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2305.17924 |