Sensing-Constrained Diversity-Multiplexing Tradeoff in MIMO ISAC: A Geometric Approach
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.
Rosa: We're looking at the paper: "Sensing-Constrained Diversity-Multiplexing Tradeoff in MIMO ISAC".
Dev: Here's the gist of the paper. Sensing-constrained diversity-multiplexing tradeoff in MIMO ISAC: A geometric approach investigates how much MIMO gain is fundamentally sacrificed in communication to integrate optimal sensing capabilities System Model and Metrics The paper considers a mono-static MIMO ISAC system where the base station performs sensing using known codewords, and the UE jointly senses and decodes The system is modeled with S&C channels (1a) and (1b), where the communication channel undergoes quasi-static Rayleigh fading Sensing performance is evaluated using the MillerChang-type Bayesian Cramer-Rao bound (BCRB) to define the conditional Bayesian Fisher information matrix Communication performance is characterized by diversity gain d ≥ 0 and multiplexing gain r ≥ 0 defined by the limits of R/log ηc and log Pe/log ηc, respectively.
Rosa: Geometric Framework for Constraints The constraint of emitting sensing-optimal waveforms confines transmit codewords to a generalized Stiefel manifold S(k,n)A defined by XXH = A This manifold is endowed with a standard Euclidean metric g(∆1, ∆2) ≜ Re
tr(∆1∆H 2): The paper leverages Riemannian geometry and large-deviation analysis to characterize the asymptotic outage probability of this typical ISAC channel.
Dev: Asymptotic Mutual Information Scaling The asymptotic mutual information for a fixed realization α as ηc → ∞ is given by IHc(X; Yc) = m squared log(πe) + log Vol(Sηc,α) This scaling result shows that the mutual information scales with log ηc with a coefficient of Prk(R) i=1 (2T + 1 − 2i)(0.5 − αi) + log(ηc).
Rosa: Only the log-singular values satisfying αi < 0.5 contribute to the asymptotic growth of IHc(X; Yc).
Paper summary: Rosa: Okay, so to recap, we’re talking about the paper "Sensing-Constrained Diversity-Multiplexing Tradeoff in MIMO ISAC: A Geometric Approach". The core idea is looking at how sensing requirements squeeze the communication gains.
Dev: They model a mono-static MIMO ISAC system under Rayleigh fading, where the base station senses using known codewords, and we look at the resulting communication performance.
Taro: Specifically, they define sensing performance using something called Miller-Chang type Bayesian Cramer-Rao bound to set a baseline for what's possible with sensing.
Rosa: Then they characterize communication performance by defining diversity gain d and multiplexing gain r based on the limits of the ratio of received signal strength to the log of the channel information.
Dev: The main mathematical tool they use is Riemannian geometry, applying it to a generalized Stiefel manifold defined by an equality involving your transmit matrix and the sensing channel response.
Taro: This manifold S(k,n) A is endowed with a standard Euclidean metric, which is used to analyze the asymptotic outage probability of this typical ISAC channel.
Rosa: They derive an asymptotic mutual information scaling result that shows how mutual information grows as the blocklength eta c goes to infinity, linking it to a specific coefficient involving T.
Dev: The key mathematical step they take is deriving a converse bound on the sensing-constrained DMT, which they write as d star R(r), and this bound is determined by an integral over some region in the alpha domain.
Taro: So, the big result they establish is that P out(r eta c) satisfies an outage exponent of eta to the power of negative d out rk(R)(r).
Rosa: This leads to theorem two, which gives them this piecewise-linear function connecting points like (r(k), d out rk(R)(r)) = k / (one - k / 2T) and ((Nc - k), rk(R) - k) <ref:2605.01889#pg2>.
Dev: Essentially, it says that the loss in MIMO gain from transmitting sensing-optimal codewords is twofold, limiting the entire DMT because you're restricted to rk(R) effective transmit dimensions.
Taro: And that this penalty grows at higher target rates, meaning the multiplexing gain suffers more when you try to push for higher data throughput.
Rosa: So they’ve provided a geometric consistency check on their bound, confirming that the result they derived is tight in some sense. That sets the stage for understanding how sensing and communication must balance each other out.
Conclusion: Dev: Looking at the whole "Sensing-Constrained Diversity-Multiplexing Tradeoff in MIMO ISAC: A Geometric Approach" paper, it really zeroes in on that fundamental tension between sensing and communication gains. The authors are Yinuo Du, Ziping Lu, Xiao Shen, Hanying Zhao, and Yuan Shen.
Rosa: Their work uses a geometric approach to precisely quantify the loss of MIMO gain when you impose sensing optimality on the waveforms in an ISAC setup under Rayleigh fading.
Dev: What this means for the field is that it gives a concrete mathematical limit—that converse bound—on what you can expect for diversity and multiplexing gains when you prioritize sensing capabilities.
Taro: It provides a clear characterization of how much MIMO gain is traded off to support optimal sensing, which isn't just some vague intuition.
Rosa: The loss they highlight is twofold: the first is that the constraint fundamentally restricts your system to rk(R) effective transmit dimensions, which limits the entire DMT compared to an unconstrained system with M dimensions.
Dev: And the second part is that even though you keep full spatial diversity, that multiplexing gain incurs a penalty that grows as you aim for higher target rates.
Taro: So it’s telling us about the tension between latency and MIMO gain in ISAC systems, especially when you are dealing with multiple targets or angle estimation scenarios.
Rosa: It confirms that this tradeoff isn't just theoretical; it has real implications for designing future low-latency integrated sensing and communication technologies for things like extended reality or massive digital twins.
Department of Electronic Engineering, BNRist, Tsinghua University · Division of Information Science and Engineering, KTH Royal Institute of Technology
eess.SP
Submitted: 2026-05-03
Updated: 2026-11-10
Comments: Accepted for presentation at IEEE GLOBECOM 2026
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 89/100
The gist: Sensing-constrained diversity-multiplexing tradeoff in MIMO ISAC: A geometric approach investigates how much MIMO gain is fundamentally sacrificed in communication to integrate optimal sensing…
Key concepts
- Sensing-Constrained Diversity-Multiplexing Tradeoff
- This refers to the fundamental compromise between maximizing how many independent communication paths (multiplexing) you can use and maximizing the robustness of those paths (diversity). In this paper, this tradeoff is specifically caused by forcing the system to use waveforms that are best for sensing, which inherently limits communication performance.
- Generalized Stiefel Manifold S(k,n)A
- This is a mathematical space where all possible transmit codewords that satisfy the sensing requirements are located. Think of it as a specific geometric shape defined by matrix equations (XXH = A). The paper uses this shape to analyze the limitations imposed on how much communication information can be sent.
- Converse Bound
- A mathematical tool used to establish a lower limit on performance. In this context, the converse bound sets an upper limit on the achievable diversity and multiplexing gains. It proves that no system operating under these sensing constraints can achieve better performance than what this derived bound allows.
- Asymptotic Mutual Information Scaling
- This describes how the total information rate of a communication channel grows as the number of transmit antennas or signal power increases infinitely. The paper shows this scaling depends on specific 'singular values' related to the sensing constraint, indicating which parts of the system contribute most to performance growth.
Terminology
Summary
Sensing-constrained diversity-multiplexing tradeoff in MIMO ISAC: A geometric approach investigates how much MIMO gain is fundamentally sacrificed in communication to integrate optimal sensing capabilities
System Model and Metrics
The paper considers a mono-static MIMO ISAC system where the base station performs sensing using known codewords, and the UE jointly senses and decodes The system is modeled with S&C channels (1a) and (1b), where the communication channel undergoes quasi-static Rayleigh fading Sensing performance is evaluated using the MillerChang-type Bayesian Cramer-Rao bound (BCRB) to define the conditional Bayesian Fisher information matrix Communication performance is characterized by diversity gain d ≥ 0 and multiplexing gain r ≥ 0 defined by the limits of R/log ηc and log Pe/log ηc, respectively.
Geometric Framework for Constraints
The constraint of emitting sensing-optimal waveforms confines transmit codewords to a generalized Stiefel manifold S(k,n)A defined by XXH = A This manifold is endowed with a standard Euclidean metric g(∆1, ∆2) ≜ Re[tr(∆1∆H 2)] The paper leverages Riemannian geometry and large-deviation analysis to characterize the asymptotic outage probability of this typical ISAC channel.
Asymptotic Mutual Information Scaling
The asymptotic mutual information for a fixed realization α as ηc → ∞ is given by IHc(X; Yc) = m squared log(πe) + log Vol(Sηc,α) This scaling result shows that the mutual information scales with log ηc with a coefficient of Prk(R) i=1 (2T + 1 − 2i)(0.5 − αi) + log(ηc). p. 2 Only the log-singular values satisfying αi < 0. p. 45 contribute to the asymptotic growth of IHc(X; Yc). p. 4
Converse Bound Derivation
The asymptotic outage probability Pout(r log ηc) is determined by the integral over a region A in the α-domain, resulting in Pout(r log ηc) = Z A pα(α) dα The following lemma provides the joint p.d.f. pα(α) required to evaluate this integral. p. 4 The asymptotic outage probability (25) satisfies Pout(r log ηc) = η(-d out rk(R)). p. 4
Final Result and Implications
Theorem 2 establishes that the outage exponent d out rk(R)(r) is the piecewise-linear function connecting the points (r(k), d out rk(R)(r(k))) = k/(1 - k/2T), ((Nc − k)(rk(R) − k)). This function serves as a converse bound for the sensing-constrained DMT d star R(r), i. p. 4e., d star R(r) ≤ d out rk(R)(r). The loss in MIMO gain from transmitting sensing-optimal codewords is twofold: first, the sensing constraint fundamentally restricts the system to rk(R) effective Tx dimensions, limiting the entire DMT second, compared to an unconstrained system with M = rk(R), although the full spatial diversity is preserved, the multiplexing gain incurs a penalty that grows at higher target rates. p. 5 p. 5
Case Study Insights
In the case study of angle estimation of multiple targets, the sensing-constrained DMT is upper-bounded by d star R(r) ≤ d out Nt(r). Counterintuitively, our DMT bound improves as Nt increases because Rayleigh fading channels inherently benefit from spatially diverse transmissions. p. 5 In the case of Hs estimation, as T increases, the constrained DMT gradually approaches the original DMT. p. 5 This behavior highlights another fundamental tradeoff unique to MIMO ISAC systems: the tension between latency and MIMO gain. p. 5
Conclusion
This paper investigates the communication DMT of a finite-blocklength MIMO ISAC system constrained to sensing-optimal waveforms Utilizing Riemannian geometry on generalized Stiefel manifolds and large-deviation analysis, we derive an elegant converse bound on the sensing-constrained DMT. Specifically, this derived bound provides a quantitative characterization of the communication MIMO gain that is traded off to support optimal sensing. p. 5 The loss in MIMO gain from transmitting sensing-optimal codewords is twofold: first, the sensing constraint fundamentally restricts the system to rk(R) effective Tx dimensions, limiting the entire DMT second, compared to an unconstrained system with M = rk(R), although the full spatial diversity is preserved, the multiplexing gain incurs a penalty that grows at higher target rates. The geometric consistency corroborates the tightness of our converse bound. p. 4
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Precision sensing-constrained waveform design: The system can transmit on a generalized Stiefel manifold X in CM times T such that XXH equals TR, which allows for an elegant converse bound on the sensing constrained DMT.
-
Outage probability characterization: The system can calculate the asymptotic outage probability Pout(R) by solving the optimization problem Pa-3, leading to a result that is a piecewiselinear function connecting points (r(k), dout rk(R)(r)).
-
Latency-aware MIMO gain trade-off: The system can quantify how much MIMO communication gain must be sacrificed to guarantee optimal sensing, showing that
the multiplexing gain incurs a penalty of k 2/2T
in the full-rank regime.
Related papers
- Open-H-RF: A Large-Scale Ultrasound Raw Channel Dataset Initiative
- Scalable Attention for 5G NR Channel Estimation
- Low-Altitude Wireless Networks: A Comprehensive Survey
- Sensing-Assisted OFDM with Index Modulation: A Waveform for Optical Wireless Integrated Communication and Localisation
- Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM
- A Foundation Model for Large-Scale Wireless Network Planning, Operation and Optimization