In this paper, we investigate the effect of output quantization on the secrecy capacity of the binary-input Gaussian wiretap channel. As a result, a closed-form expression with infinite summation terms of the secrecy capacity of the binary-input Gaussian wiretap channel is derived for the case when both the legitimate receiver and the eavesdropper have unquantized outputs. In particular, computable tight upper and lower bounds on the secrecy capacity are obtained. Theoretically, we prove that when the legitimate receiver has unquantized outputs while the eavesdropper has binary quantized outputs, the secrecy capacity is larger than that when both the legitimate receiver and the eavesdropper have unquantized outputs or both have binary quantized outputs. Further, numerical results show that in the low signal-to-noise ratio (SNR) (of the main channel) region, the secrecy capacity of the binary input Gaussian wiretap channel when both the legitimate receiver and the eavesdropper have unquantized outputs is larger than the capacity when both the legitimate receiver and the eavesdropper have binary quantized outputs; as the SNR increases, the secrecy capacity when both the legitimate receiver and the eavesdropper have binary quantized outputs tends to overtake.
We study the secrecy capacity of the Gaussian wiretap channel with binary input under either soft or hard decision decoding. A closed-form expression of the secrecy capacity is derived by assuming that the eavesdropper uses the same decoding method as the legitimate receiver. An upper bound of the loss of secrecy capacity is provided whilst a smart eavesdropper choosing the best decoding method and a legitimate receiver employing an insufficient decoding method. Simulations show that in the low SNR (of the main channel) region, the secrecy capacity of the binary-input Gaussian wiretap channel under soft decision decoding is larger than the one under hard decision decoding; as the SNR increases, the secrecy capacity under hard decision decoding tends to overtake.
We consider a complex Gaussian wiretap channel with finite-resolution analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. For this channel, we show that a positive secrecy rate is always achievable as long as the channel gains at the legitimate receiver and at the eavesdropper are different, regardless of the quantization levels of the ADCs. For the achievability, we first consider the case of the one-bit ADCs at the legitimate receiver and apply a binary input distribution where the two input points have the same phase when the channel gain at the legitimate receiver is less than that at the eavesdropper, and otherwise the opposite phase. Then the result is generalized for the case of arbitrary finite-resolution ADCs at the legitimate receiver by translating the input distribution appropriately. We also provide numerical lower bounds on the achievable secrecy rates, and analyze the tendency of the secrecy rates according to the channel difference, the power constraint, and the quantization levels for some cases. For the special case of the real Gaussian wiretap channel with one-bit ADCs at both the legitimate receiver and the eavesdropper, we show that our choice of phase does not lose any optimality for the Wyner code.
We study the secrecy capacity of fast fading channels under imperfect main channel (between the transmitter and the legitimate receiver) estimation at the transmitter. Lower and upper bounds on the ergodic secrecy capacity are derived for a class of independent identically distributed (i.i.d.) fading channels. The achievable rate follows from a standard wiretap code in which a simple on-off power control is employed along with a Gaussian input. The upper bound is obtained using an appropriate correlation scheme of the main and eavesdropper channels and is the best known upper bound so far. The upper and lower bounds coincide with recently derived ones in case of perfect main CSI. Furthermore, the upper bound is tight in case of no main CSI, where the secrecy capacity is equal to zero. Asymptotic analysis at high and low signal-to-noise ratio (SNR) is also given. At high SNR, we show that the capacity is bounded by providing upper and lower bounds that depend on the channel estimation error. At low SNR, however, we prove that the secrecy capacity is asymptotically equal to the capacity of the main channel as if there were no secrecy constraint. Numerical results are provided for i.i.d. Rayleigh fading channels.
We consider the Gaussian wiretap channel with onebit analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. In this channel, we show that a positive secrecy rate is always achievable whenever the noise power n12at the legitimate receiver is not the same as the noise power n22at the eavesdropper. A binary phase-shift keying (BPSK) and an asymmetric BPSK are shown to achieve a positive secrecy rate for the cases of n12and n1> n2, respectively. We partially justify the choice of these signalings by showing that the optimal input distribution that achieves Rs* := supPX:E[X2]≤PI(X; Y1) - I(X; Y2), where X is the channel input with power constraint of P, and Y1and Y2are the channel outputs at the legitimate receiver and the eavesdropper, respectively, should satisfy some symmetric and asymmetric properties for the cases of n12and n1> n2, respectively. Moreover, for n12and sufficiently large P, it is shown that a BPSK using power smaller than P achieves Rs*.
We study the secrecy capacity of Gaussian wiretap channel aided by an external jammer/helper. Both the transmitter and the intended receiver are equipped with a single antenna, while the eavesdropper and the jammer are equipped with
Mand
Nantennas, respectively. Generally, an analytical form of the secrecy capacity in this scenario is difficult to obtain. Instead, we consider a null-space jamming scheme which totally nulls out the jamming signal at the legitimate receiver, and derive lower and upper bounds on its maximal achievable secrecy rate
RN. The relationship between the average secrecy capacity
CˉNof Gaussian wiretap channel and the average secrecy rate
RˉNachieved by the null-space jamming scheme is investigated, and we prove that
RˉN≤CˉN≤RˉN+1. Based on this inequality and the derived lower and upper bounds on
RN, the upper and lower bounds on the average secrecy capacity of Gaussian wiretap channel aided by an external jammer can be obtained, where our result shows that when
N>M, the average secrecy capacity increases linearly with the total transmit power; while when
N≤M−1, there exists a performance ceiling on it.