The Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel is studied in this paper. The base station broadcasts confidential messages to K intended users while keeping the messages secret from an eavesdropper. The capacity of this channel has already been characterized by applying dirty-paper coding and stochastic encoding. However, K factorial encoding orders may need to be enumerated for that, which makes the problem intractable. We prove that there exists one optimal encoding order and reduced the K factorial times to a one-time encoding. The optimal encoding order is proved by forming a secrecy weighted sum rate (WSR) maximization problem. The optimal order is the same as that for the MIMO broadcast channel without secrecy constraint, that is, the weight of users' rate in the WSR maximization problem determines the optimal encoding order. Numerical results verify the optimal encoding order.
翻译:本文研究了高斯多输入多输出(MIMO)多接收窃听器窃听频道。 基地台向K预定用户发送机密信息,同时将信息从窃听器中保守秘密。 该频道的能力特点已经通过使用脏纸编码和随机编码来描述。 但是, 可能需要为此列出K因子编码命令, 从而使得问题难以解决。 我们证明有一个最佳编码命令, 并将K因数时间降为一次性编码。 通过形成保密加权总和率( WSR)最大化问题来证明最佳编码命令。 最优的顺序与MIMO广播频道一样,没有保密限制, 也就是说, 用户在WSR最大化问题中的比例决定了最佳编码顺序。 数字结果验证了最佳编码顺序 。