论文标题
k获取器窃听通道：最佳编码顺序和信号设计
K-Receiver Wiretap Channel: Optimal Encoding Order and Signaling Design
论文作者
论文摘要
K获取器窃听通道是一个频道模型，发射器将k独立的消息传播给了k的接收器，同时使它们向窃听者保持秘密。通过使用脏纸编码和随机编码来表征K-获取器多输入多输出（MIMO）窃听通道的容量区域。但是，可能需要列举k阶乘编码订单以评估容量区域，这使问题很棘手。此外，即使已知容量区域，达到容量区域的最佳信号传导尚不清楚。在本文中，我们确定一个最佳编码顺序，以达到容量区域的每个点，从而减少编码复杂性k阶乘时间。我们证明，K获取器MIMO Wiletap通道的最佳解码顺序与无保密的MIMO广播通道的最佳解码顺序相同。具体而言，加权总和（WSR）最大化问题中的降级排序确定最佳编码顺序。接下来，为了到达保密能力区域的边界，我们形成了WSR最大化问题，并应用块连续的最大化方法来解决此非凸问题，并找到与每个消息相对应的输入协方差矩阵。数值结果用于验证编码顺序的最佳性，并证明所提出的信号设计的功效。
The K-receiver wiretap channel is a channel model where a transmitter broadcasts K independent messages to K intended receivers while keeping them secret from an eavesdropper. The capacity region of the K-receiver multiple-input multiple-output (MIMO) wiretap channel has been characterized by using dirty-paper coding and stochastic encoding. However, K factorial encoding orders may need to be enumerated to evaluate the capacity region, which makes the problem intractable. In addition, even though the capacity region is known, the optimal signaling to achieve the capacity region is unknown. In this paper, we determine one optimal encoding order to achieve every point on the capacity region, and thus reduce the encoding complexity K factorial times. We prove that the optimal decoding order for the K-receiver MIMO wiretap channel is the same as that for the MIMO broadcast channel without secrecy. To be specific, the descending weight ordering in the weighted sum-rate (WSR) maximization problem determines the optimal encoding order. Next, to reach the border of the secrecy capacity region, we form a WSR maximization problem and apply the block successive maximization method to solve this nonconvex problem and find the input covariance matrices corresponding to each message. Numerical results are used to verify the optimality of the encoding order and to demonstrate the efficacy of the proposed signaling design.
