“…In conclusion, the function value is increasing throughout the fixed point iteration (35) and it has an upper bound. Therefore, the fixed point iteration (35) is bound to converge.…”
Section: Appendix B Proof Of Theoremmentioning
confidence: 83%
“…In this paper, similar to [35], we aim to maximize the worstcase secrecy rate of multiple users for guaranteeing user fairness in terms of the achievable secrecy performance. In particular, the minimum secrecy rate (Bits/s/Hz) of the K users is…”
Section: System Model and Problem Statement A System Modelmentioning
confidence: 99%
“…We first prove the convergence of fixed point iteration (35). For proving the convergence of fixed point iteration (35), we should show that the OF value is increasing throughout the iterative process, i.e., The equality (a) is valid, because Υ is positive-semidefinite and µ(l) H Υµ(l − 1) is real.…”
Section: Appendix B Proof Of Theoremmentioning
confidence: 99%
“…We first prove the convergence of fixed point iteration (35). For proving the convergence of fixed point iteration (35), we should show that the OF value is increasing throughout the iterative process, i.e., The equality (a) is valid, because Υ is positive-semidefinite and µ(l) H Υµ(l − 1) is real. Additionally, |Υµ| 1 ≤ |Υ| 1 due to the property of the norm of the product of two matrices [38], which represents an upper bound of the value obtained by the fixed-point iteration (35).…”
Section: Appendix B Proof Of Theoremmentioning
confidence: 99%
“…As shown in [41], the limit point obtained by the fixed point iteration (35) can be characterized by the following equation…”
Millimeter wave (mmWave) communications and cognitive radio technologies constitute key technologies of improving the spectral efficiency of communications. Hence, we conceive a hybrid secure precoder for enhancing the physical layer security of a cognitive mmWave wiretap channel, where a secondary transmitter broadcasts confidential information signals to multiple secondary users under the interference temperature constraint of the primary user (PU). The optimization problem is formulated as jointly optimizing the analog and digital precoder for maximizing the minimum secrecy rate of all the secondary users under practical constraints. In particular, our design satisfies the constraint on the maximum interference power received by multiple PUs, as well as the secondary users' minimum quality-of-service (Qos), and the unit-modulus constraint on the analog precoder. Due to the non-convexity of the resultant objective function and owing to the coupling between the analog and digital precoder, the optimization problem formulated is nonconvex and nonlinear, hence it is very challenging to solve directly. Hence, we first transform it into a tractable form, and develop a penalty dual decomposition (PDD) based iterative algorithm to locate its Karush-Kuhn-Tucker (KKT) solution. Finally, we generalize the proposed PDD algorithm to a secure hybrid precoder design relying on practical finite-resolution phase shifters and show that the proposed PDD algorithm can be straightforwardly adapted to handle the scenario, where each PU is equipped with multiple antennas and the CSI of multiple eavesdroppers (Eves) is imperfectly known. Our simulation results validate the efficiency of the proposed iterative algorithm.
“…In conclusion, the function value is increasing throughout the fixed point iteration (35) and it has an upper bound. Therefore, the fixed point iteration (35) is bound to converge.…”
Section: Appendix B Proof Of Theoremmentioning
confidence: 83%
“…In this paper, similar to [35], we aim to maximize the worstcase secrecy rate of multiple users for guaranteeing user fairness in terms of the achievable secrecy performance. In particular, the minimum secrecy rate (Bits/s/Hz) of the K users is…”
Section: System Model and Problem Statement A System Modelmentioning
confidence: 99%
“…We first prove the convergence of fixed point iteration (35). For proving the convergence of fixed point iteration (35), we should show that the OF value is increasing throughout the iterative process, i.e., The equality (a) is valid, because Υ is positive-semidefinite and µ(l) H Υµ(l − 1) is real.…”
Section: Appendix B Proof Of Theoremmentioning
confidence: 99%
“…We first prove the convergence of fixed point iteration (35). For proving the convergence of fixed point iteration (35), we should show that the OF value is increasing throughout the iterative process, i.e., The equality (a) is valid, because Υ is positive-semidefinite and µ(l) H Υµ(l − 1) is real. Additionally, |Υµ| 1 ≤ |Υ| 1 due to the property of the norm of the product of two matrices [38], which represents an upper bound of the value obtained by the fixed-point iteration (35).…”
Section: Appendix B Proof Of Theoremmentioning
confidence: 99%
“…As shown in [41], the limit point obtained by the fixed point iteration (35) can be characterized by the following equation…”
Millimeter wave (mmWave) communications and cognitive radio technologies constitute key technologies of improving the spectral efficiency of communications. Hence, we conceive a hybrid secure precoder for enhancing the physical layer security of a cognitive mmWave wiretap channel, where a secondary transmitter broadcasts confidential information signals to multiple secondary users under the interference temperature constraint of the primary user (PU). The optimization problem is formulated as jointly optimizing the analog and digital precoder for maximizing the minimum secrecy rate of all the secondary users under practical constraints. In particular, our design satisfies the constraint on the maximum interference power received by multiple PUs, as well as the secondary users' minimum quality-of-service (Qos), and the unit-modulus constraint on the analog precoder. Due to the non-convexity of the resultant objective function and owing to the coupling between the analog and digital precoder, the optimization problem formulated is nonconvex and nonlinear, hence it is very challenging to solve directly. Hence, we first transform it into a tractable form, and develop a penalty dual decomposition (PDD) based iterative algorithm to locate its Karush-Kuhn-Tucker (KKT) solution. Finally, we generalize the proposed PDD algorithm to a secure hybrid precoder design relying on practical finite-resolution phase shifters and show that the proposed PDD algorithm can be straightforwardly adapted to handle the scenario, where each PU is equipped with multiple antennas and the CSI of multiple eavesdroppers (Eves) is imperfectly known. Our simulation results validate the efficiency of the proposed iterative algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.