arXiv subjects

Shuangqin Wei

Publications and source records attributed to Shuangqin Wei.

3 recordsLinked to original sources

arXiv2023

Finite Blocklength Analysis of Gaussian Random coding in AWGN Channels under Covert constraints II: Viewpoints of Total Variation Distance

Covert communication over an additive white Gaussian noise (AWGN) channel with finite block length is investigated in this paper. The attention is on the covert criterion, which has not been considered in finite block length circumstance. As an accurate quantity metric of discrimination, the variation distance with given finite block length n and signal-noise ratio (snr) is obtained. We give both its analytic solution and expansions which can be easily evaluated. It is shown that K-L distance, which is frequently adopted as the metric of discrimination at the adversary in asymptotic regime, is not convincing in finite block length regime compared with the total variation distance. Moreover, the convergence rate of the total variation with different snr is analyzed when the block length tends to infinity. The results will be very helpful for understanding the behavior of the total variation distance and practical covert communication.

cs.IT↗

arXiv2020

Finite Blocklength Analysis of Gaussian Random Coding in AWGN Channels under Covert Constraint

This paper considers the achievability and converse bounds on the maximal channel coding rate at a given blocklength and error probability over AWGN channels. The problem stems from covert communication with Gaussian codewords. By re-visiting [18], we first present new and more general achievability bounds for random coding schemes under maximal or average probability of error requirements. Such general bounds are then applied to covert communication in AWGN channels where codewords are generated from Gaussian distribution while meeting the maximal power constraint. Further comparison is made between the new achievability bounds and existing one with deterministic codebooks.

cs.IT↗

arXiv2020

Total Variation Distance Based Performance Analysis of Covert Communication over AWGN Channels in Non-asymptotic Regime

This paper investigates covert communication over an additive white Gaussian noise (AWGN) channel in finite block length regime on the assumption of Gaussian codebooks. We first review some achievability and converse bounds on the throughput under maximal power constraint. From these bounds and the analysis of TVD at the adversary, the first and second asymptotics of covert communication are investigated by the help of some divergences inequalities. Furthermore, the analytic solution of TVD, and approximation expansions which can be easily evaluated with given snr (signal noise ratio) are presented. In this way, the proper power level for covert communication can be approximated with given covert constraint of TVD, which leads to more accurate estimation of the power compared with preceding bounds. Further elaboration on the effect of such asymptotic characteristics on the primary channels's throughput in finite block regime is also provided. The results will be very helpful for understanding the behavior of the total variation distance and practical covert communication.

cs.IT↗