International Conference on Communications
Secrecy Capacity of the Fast Fading SISO Wiretap Channel within 11 Bits with Only CSIR
Sanjay Karmakar, Anirban Ghosh
Abstract
We consider a fast fading 2-receiver Broadcast channel (BC), where one of the receivers is legitimate and the other is malicious/unintended. The instantaneous Channel State Information (CSI) is assumed to be known only at the receivers (CSIR). The secrecy capacity of this channel is characterized within 11 bits irrespective of fading statistics and Signal-to- Noise Ratios (SNRs). This is achieved by deriving a new upper bound to the secrecy capacity of the channel and two new lower bounds. The upper bound is derived by approximating Complementary Cumulative Distribution Functions (CCDFs) of the two links by corresponding staircase functions and has the desirable property of easy computability for arbitrary fading statistics. The smaller lower bound, although looser, has a form which can be analytically compared with the upper bound and facilitates the approximate secrecy capacity characterization. It is proved that, the so called Binary Expansion Signaling with Reverse Stripping (BES-RS) scheme can achieve a secrecy rate larger than both these lower bounds. This result establishes BES-RS scheme as a practically implementable coding scheme that can achieve the secrecy capacity of the FWC within a constant number of bits, where the constant is universal across all fading statistics and SNR. Explicit numerical computation of these bounds shows that the difference between the secrecy rate achievable by the BES-RS scheme and the upper bound is much smaller than the aforementioned universal constant. This in turn suggests that, much of the gap of 11 bits originates from the looseness introduced to bring the two bounds in a compatible form.