Abstract
We consider MIMO multi-receiver wiretap channels where the transmitter sends confidential messages to legitimate receivers in the presence of an external eavesdropper. Since the secrecy sum rate maximization problem is nonconvex, we derive an equivalent alternating optimization problem. We propose an iterative algorithm to find the optimal transmit covariance matrix based on the MIMO BC-MAC duality. We prove that the limit point satisfies the KKT conditions of the original secrecy sum rate maximization problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
