On SDoF of Multi-Receiver Wiretap Channel With Alternating CSIT

We study the problem of secure transmission over a Gaussian multi-input single-output (MISO) two receiver channel with an external eavesdropper, under the assumption that the state of the channel which is available to each receiver is conveyed either perfectly ($P$) or with delay ($D$) to the transmitter. Denoting by $S_1$, $S_2$, and $S_3$ the channel state information at the transmitter (CSIT) of user 1, user 2, and eavesdropper, respectively, the overall CSIT can then alternate between eight possible states, i.e., $(S_1,S_2,S_3) \in \{P,D\}^3$. We denote by $\lambda_{S_1 S_2 S_3}$ the fraction of time during which the state $S_1S_2S_3$ occurs. Under these assumptions, we first consider the Gaussian MISO wiretap channel and characterize the secure degrees of freedom (SDoF). Next, we consider the general multi-receiver setup and characterize the SDoF region of fixed hybrid states $PPD$, $PDP$, and $DDP$. We then focus our attention on the symmetric case in which $\lambda_{PDD}=\lambda_{DPD}$. For this case, we establish bounds on SDoF region. The analysis reveals that alternating CSIT allows synergistic gains in terms of SDoF; and shows that, by opposition to encoding separately over different states, joint encoding across the states enables strictly better secure rates. Furthermore, we specialize our results for the two receivers channel with an external eavesdropper to the two-user broadcast channel. We show that, the synergistic gains in terms of SDoF by alternating CSIT is not restricted to multi-receiver wiretap channels; and, can also be harnessed under broadcast setting.Comment: To Appear in IEEE Transactions on Information Forensics and Securit

Capacity of a Class of State-Dependent Orthogonal Relay Channels

The class of orthogonal relay channels in which the orthogonal channels connecting the source terminal to the relay and the destination, and the relay to the destination, depend on a state sequence, is considered. It is assumed that the state sequence is fully known at the destination while it is not known at the source or the relay. The capacity of this class of relay channels is characterized, and shown to be achieved by the partial decode-compress-and-forward (pDCF) scheme. Then the capacity of certain binary and Gaussian state-dependent orthogonal relay channels are studied in detail, and it is shown that the compress-and-forward (CF) and partial-decode-and-forward (pDF) schemes are suboptimal in general. To the best of our knowledge, this is the first single relay channel model for which the capacity is achieved by pDCF, while pDF and CF schemes are both suboptimal. Furthermore, it is shown that the capacity of the considered class of state-dependent orthogonal relay channels is in general below the cut-set bound. The conditions under which pDF or CF suffices to meet the cut-set bound, and hence, achieve the capacity, are also derived.Comment: This paper has been accepted by IEEE Transactions on Information Theor