Secure Degrees of Freedom of the Three-User MIMO Broadcast Channel With Delayed CSIT

This paper investigates the sum-secure degrees-of-freedom (SDoF) of three-user multiple-input multiple-output (MIMO) broadcast channel with confidential messages (BCCM) and delayed channel state information at the transmitter (CSIT). Specifically, we obtain non-trivial sum-SDoF upper and lower bounds. Firstly, we derive the sum-SDoF upper bound by means of statistical equivalence property, security constraints, and permutations. Then, for the sum-SDoF lower bound, we leverage the artificial noise transmission and interference re-transmission to design two transmission schemes, which have holistic and sequential higher-order symbol generation, respectively. For these two schemes, we propose the redundancy reduction approach for security analysis, by which the minimal duration of artificial noise transmission phase of the scheme is obtained. To eliminate the redundant equations in security analysis, this approach first identifies the constituent equations, and then analyzes the rank of assemble of them. As a result, both the proposed sum-SDoF upper and lower bounds are tighter than the existing sum-SDoF upper and lower bounds, respectively. Furthermore, the proposed lower bound showcases a three-user coding gain.

Automated summary

This paper investigates the sum-secure degrees-of-freedom of a three-user MIMO broadcast channel with delayed CSIT and confidential messages. Non-trivial upper and lower bounds for the sum-secure degrees-of-freedom are derived using statistical equivalence property, security constraints, and permutations. Two transmission schemes with holistic and sequential higher-order symbol generation are proposed, along with a redundancy reduction approach for security analysis. The proposed bounds are tighter than existing ones and the lower bound showcases a three-user coding gain.