• Corpus ID: 239049517

Performance Analysis for Covert Communications Under Faster-than-Nyquist Signaling

  title={Performance Analysis for Covert Communications Under Faster-than-Nyquist Signaling},
  author={Yuan Li and Yuchen Zhang and Wanyu Xiang and Jianquan Wang and Sa Xiao and Liang Chang and Wanbin Tang},
In this letter, we analyze the performance of covert communications under faster-than-Nyquist (FTN) signaling in the Rayleigh block fading channel. Both Bayesian criterionand Kullback-Leibler (KL) divergence-based covertness constraints are considered. Especially, for KL divergence-based one, we prove that both the maximum transmit power and covert rate under FTN signaling are higher than those under Nyquist signaling. Numerical results coincide with our analysis and validate the advantages of… 

Figures and Tables from this paper


Properties of faster-than-Nyquist channel matrices and folded-spectrum, and their applications
  • Y. Kim
  • Computer Science
    2016 IEEE Wireless Communications and Networking Conference
  • 2016
This work studies key properties of the FTN channel matrices and the folded-spectrum, and elucidate precise relationships between the two and applies the presented properties to provide key insights in to FTN signaling including how many signaling dimensions FTN has access to, qualities of those dimensions, and how fast should the symbol rate be.
Limits of Reliable Communication with Low Probability of Detection on AWGN Channels
We present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels. Specifically, if the
Gaussian Signalling for Covert Communications
It is proved that Gaussian signalling is optimal in terms of maximizing the mutual information of transmitted and received signals for covert communications with an upper bound ontex-math notation="LaTeX" as the constraint, for which skew-normal signalling can outperform theGaussian signalling in Terms of achieving higher mutual information.
Cholesky-Decomposition Aided Linear Precoding and Decoding for FTN Signaling
The proposed Cholesky-decomposition aided linear precoding and decoding scheme for FTN signaling is proved to fully cancel the incurred ISI, which renders the optimal bit error rate for any sampling rate theoretically.
Covert Wireless Communications Under Quasi-Static Fading With Channel Uncertainty
It is shown that in the large detection error regime, Willie’s detection performances of these two cases are essentially indistinguishable, which implies that the quality of CSI does not help Willie in improving his detection performance.
Secrecy Performance of Eigendecomposition-Based FTN Signaling and NOFDM in Quasi-Static Fading Channel
In this paper, we investigate the information-theoretic secrecy performance of recent precoded faster-than-Nyquist signaling (FTN) with the aid of optimal power allocation in eigenspace. More
A Variable Symbol Duration Based FTN Signaling Scheme for PLS
A variable symbol duration based faster-than-Nyquist (FTN) signaling scheme for PLS is proposed and the positivity of the secrecy rate of the cooperative link is proved.
Covert Communication With the Help of Relay and Channel Uncertainty
It is shown that Alice can transmit bits in aninline-formula to achieve covert communication in relay networks with the help of relay and channel uncertainty, which introduces confusions to degrade the performance of Willie’s detection.
SVD-Precoded Faster-Than-Nyquist Signaling With Optimal and Truncated Power Allocation
This study proposes a precoded faster-than-Nyquist (FTN) signaling scheme based on singular-value decomposition (SVD) with optimal power allocation and demonstrates that the proposed scheme outperforms its conventional Nyquist-criterion-based counterpart and the conventional SVD-precoded FTN signaling scheme, which does not use power allocation.
Filter Hopping Based Faster-Than-Nyquist Signaling for Physical Layer Security
The results show that even the eavesdropping link is much better than the legitimate link, a positive secrecy rate is also obtained and the comparisons with other information-theoretic security schemes are also shown.