论文标题
评论“认知模拟物窃听通道的预编码和人工噪声设计”
Comments on "Precoding and Artificial Noise Design for Cognitive MIMOME Wiretap Channels"
论文作者
论文摘要
[1]中的几个差距和错误被识别和纠正。在适应这些校正的同时，允许严格的证据表明，对于保密率最大化（SRM），[1]中的连续凸近似算法确实会产生真正的保密率的增加且有限的顺序，从而收敛。进一步表明，其收敛点是原始SRM问题的KKT点，如果原始问题是凸的，则该收敛点是全球最佳的，通常不一定是这种情况。建立了真实和近似保密率的序列的交织属性。
Several gaps and errors in [1] are identified and corrected. While accommodating these corrections, a rigours proof is given that the successive convex approximation algorithm in [1] for secrecy rate maximization (SRM) does generate an increasing and bounded sequence of true secrecy rates and hence converges. It is further shown that its convergence point is a KKT point of the original SRM problem and, if the original problem is convex, this convergence point is globally-optimal, which is not necessarily the case in general. An interlacing property of the sequences of the true and approximate secrecy rates is established.
