Abstract
The secure degrees of freedom (SDoF) of two-user rank-deficient multiple-input multiple-output (MIMO) broadcast channel with confidential messages (BCCM) and two-user rank- deficient MIMO interference channel with confidential messages (ICCM) are studied respectively in this paper. In the systems, each transmitter has $M$ antennas, and each receiver has $N$ antennas. We consider that each transmitter intends to send secure messages to the corresponding receiver, and another receiver can receive the messages but cannot decode them, which ensures that the messages are confidential. Comparing with previous studies on two-user broadcast channel and interference channel, we explore the case that channel matrices are rank-deficient, and the rank of channel matrices can take arbitrary value, $D \leq \text{min} (M,N)$ . For the two rank-deficient channels, BCCM and ICCM, we divide the problem into several regimes according to the different configurations of the rank of channel matrices and the number of antennas at each node. The outer bound of rank-deficient BCCM is inferred from information theoretic methods and the achievable schemes are given by zero forcing techniques. We derive the outer bound of rank-deficient ICCM by taking the minimum region of the three outer bounds, where the first outer bound is the result of rank-deficient interference channel model without secrecy constraints, the second outer bound is obtained by considering secrecy constraints, and the third outer bound is achieved by transmitters cooperation. Then we present the achievable schemes by combining zero-forcing, real interference alignment, and spatial alignment. Finally, we determine the exact SDoF of the rank-deficient BCCM and the rank-deficient ICCM.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.