Two-user Multiple-input Single-output Broadcast Channel Research Articles

On Linear Precoding for the Two-User MISO Broadcast Channel With Confidential Messages and Per-Antenna Constraints

We study the design of linear precoders for secure transmission in the two-user multiple-input single-output (MISO) broadcast channel with confidential messages (BC-CM). The transmitter has multiple antennas, and each user has a single receive antenna. Two independent messages are simultaneously transmitted, one intended for each user, and each message should be kept confidential from the other user. Assuming real-valued transmitted signals, we design the linear precoders subject to total and per-antenna average power constraints, and also subject to amplitude constraints. In both cases, we tackle the design problem via weighted secrecy sum rate maximization. The resulting problem, however, involves a fractional objective, making it nonconvex and difficult to solve. Nevertheless, we show that this difficult problem can be transformed into a more tractable problem, for which a solution can be obtained by an iterative search algorithm. In addition, we characterize a condition under which the obtained solution is guaranteed to be optimal. Furthermore, we show that the problem formulation and solution approach can be easily extended to handle the robust version of the design problem with uncertain channel information. We provide numerical examples to demonstrate the performance of the proposed precoder in terms of the achievable secrecy rate regions subject to the aforementioned constraints. We also demonstrate the performance of the robust precoder under different channel uncertainty levels.

Secure Degrees of Freedom Region of the Two-User MISO Broadcast Channel With Alternating CSIT

The two user multiple-input single-output (MISO) broadcast channel with confidential messages (BCCM) is studied, in which the nature of channel state information at the transmitter (CSIT) from each user can be of the form $I_{i}$ , $i=1,2$ where $I_{1}, I_{2}\in \{\mathsf {P}, \mathsf {D}, \mathsf {N}\}$ , and the forms $\mathsf {P}$ , $\mathsf {D}$ , and $\mathsf {N}$ correspond to perfect and instantaneous, completely delayed, and no CSIT, respectively. Thus, the overall CSIT can alternate between nine possible states corresponding to all possible values of $I_{1}I_{2}$ , with each state occurring for $\lambda _{I_{1}I_{2}}$ fraction of the total duration. We assume that perfect and instantaneous CSI is available at the all receivers. The main contribution of this paper is to establish the secure degrees of freedom (s.d.o.f.) region of the MISO BCCM with alternating CSIT with the symmetry assumption, where $\lambda _{I_{1} I_{2}}=\lambda _{I_{2}I_{1}}$ . The main technical contributions include developing 1) novel achievable schemes for MISO BCCM with alternating CSIT with security constraints, which also highlight the synergistic benefits of inter-state coding for secrecy; 2) new converse proofs via local statistical equivalence and channel enhancement; and 3) showing the interplay between various aspects of channel knowledge and their impact on s.d.o.f.