{"ID":2826076,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.19013","arxiv_id":"2512.19013","title":"The MIMO-ME-MS Channel: Analysis and Algorithm for Secure MIMO Integrated Sensing and Communications","abstract":"This paper addresses precoder design for secure multiple-input multiple-output (MIMO) integrated sensing and communications (ISAC) systems. We introduce a MIMO channel with a multiple-antenna eavesdropper and a multiple-antenna sensing receiver (MIMO-ME-MS) and analyze the fundamental performance limits of this tripartite tradeoff. Using sensing mutual information, we formulate the precoder design as a nonconvex weighted sum rate maximization problem. A high signal-to-noise ratio analysis based on a subspace decomposition characterizes the maximum weighted degrees of freedom. This analysis reveals the structure of a quasi-optimal precoder that must span the ``useful subspace'' and demonstrates the inadequacy of extending known schemes from simpler wiretap or ISAC channels. To solve this nonconvex problem, we develop a practical two-stage iterative algorithm that alternates between a sequential basis construction stage and a power allocation stage that solves the resulting difference-of-convex program. We demonstrate that the proposed method captures the desirable precoder structure identified in our analysis and achieves substantial performance gains in the MIMO-ME-MS channel.","short_abstract":"This paper addresses precoder design for secure multiple-input multiple-output (MIMO) integrated sensing and communications (ISAC) systems. We introduce a MIMO channel with a multiple-antenna eavesdropper and a multiple-antenna sensing receiver (MIMO-ME-MS) and analyze the fundamental performance limits of this tripart...","url_abs":"https://arxiv.org/abs/2512.19013","url_pdf":"https://arxiv.org/pdf/2512.19013v3","authors":"[\"Seongkyu Jung\",\"Namyoon Lee\",\"Jeonghun Park\"]","published":"2025-12-22T04:03:04Z","proceeding":"eess.SP","tasks":"[\"eess.SP\"]","methods":"[]","has_code":false}
