Notice of Violation of IEEE Publication Principles: Robust Secure Precoding Design for MIMO SWIPT System With Bounded Channel Uncertainties

Notice of Violation of IEEE Publication Principles

"Robust Secure Precoding Design for MIMO SWIPT System with Bounded Channel Uncertainties"
by H. Niu, B. Zhang, Y. Huang, Z. Chu, Z. Zhu and D. Guo,
in IEEE Access, vol. 6, 2018, pp. 7888-7896

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.

This paper copied work from the paper cited below. The work was copied by Zheng Chu during the review of the original paper, and reused in the offending paper without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

"Robust Secure Beamforming in a Multiple-input-multiple-output Wiretap Channel with Worst-case Channel Uncertainties"
by Miao Jiang, Yiqing Li, Qi Zhang, Quanzhong Li, Jiayin Qin
submitted to IEEE IEEE Transactions on Signal Processing, January 19, 2017


We investigate the worst-case robust secure precoding design for simultaneous wireless information and power transfer in multiple-input-multiple-output wiretap system, which consists of one transmitter, one information receiver, and one energy receiver. By treating the ER as potential eavesdropper, we aim to maximize the worst-case secrecy rate by designing the transmit precoding matrix. This is a typical non-convex optimal design while the channel state information uncertainties make this problem harder to handle, thus we propose a new method to obtain the solution. Specifically, instead of approximating the logarithmic determinant as a trace, we propose to linearize the two log-det terms. After linearization, epigraph reformulation is used to deal with the bounded channel uncertainties. Then, an alternating optimization method is utilized to solve the reformulated problem. After obtaining the precoding matrix, we derive the worst-case secrecy rate by solving another optimal problem with respect to the channel uncertainty. Numerical results validate the performance of our proposed design.