4.7 Article

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

期刊

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
卷 72, 期 1, 页码 704-717

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2022.3203804

关键词

MIMO communication; Symbols; Security; Upper bound; MISO communication; Redundancy; Receiving antennas; Broadcast channel; confidential messages; delayed CSIT; secure capacity; SDoF

向作者/读者索取更多资源

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.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据