Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sum S&C Mutual Information in ISAC

Updated 25 January 2026
  • Sum S&C MI is a metric that unifies sensing and communication mutual information in ISAC systems, enabling performance optimization for both deterministic and random signaling scenarios.
  • It employs gradient-based waveform and precoder designs, explicitly linking information-theoretic measures with classical metrics like MMSE and Bayesian CRB.
  • Weighted-sum designs reveal convex trade-offs, effectively balancing energy allocation across eigen-modes in multi-user and multi-target ISAC environments.

Sum Sensing & Communication Mutual Information (S&C MI) refers to the unified metric formed by adding the mutual information (MI) from the sensing function and the communication function within an integrated sensing and communication (ISAC) system. This sum provides a rigorous, information-theoretic criterion for evaluating and optimizing joint system performance, and can be precisely formulated for a range of channel models with both deterministic and random signaling. The S&C MI framework formalizes the shared operational units and mathematical structure of sensing MI (SMI) and communication MI (CMI), enables gradient-based waveform or precoder design for joint tasks, and connects to classical performance bounds (MMSE, Bayesian CRB) via explicit large-system limits.

1. Formal Definition and Additivity

Let IsI_s denote the sensing MI—the mutual information between a signal reflecting environment parameters and the observed receiver output, often conditioned on a known transmit waveform; let IcI_c denote the communication MI—the mutual information between transmitted and received symbols over the communication channel. In practical ISAC settings, both are measured in the same units (bits or nats) and possess closed-form expressions under linear-Gaussian models.

The sum S&C MI is then

Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c

and optionally, in weighted form,

Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s

with α[0,1]\alpha \in [0, 1] a user-selected tradeoff parameter (Ouyang et al., 2022, Peng et al., 2023, Xie et al., 2024, Piao et al., 2023). This metric is well-defined for deterministic (fixed waveform) and random (Gaussian codebook) signaling scenarios.

2. Sensing and Communication MI: Channel Models

In prototypical MIMO Gaussian models:

  • Sensing Channel (random linear model):

Ys=HsX+Ns\mathbf{Y}_s = \mathbf{H}_s \mathbf{X} + \mathbf{N}_s

where Hs\mathbf{H}_s is a random target response with prior covariance R\mathbf{R}; X\mathbf{X} is the (known or random) transmit waveform; Ns\mathbf{N}_s is Gaussian noise.

The SMI is:

IcI_c0

or, for deterministic IcI_c1,

IcI_c2

(Ouyang et al., 2022, Xie et al., 2024).

  • Communication Channel (standard MIMO):

IcI_c3

with IcI_c4 as the channel matrix, IcI_c5 as noise.

The CMI is:

IcI_c6

or for random codebooks,

IcI_c7

where IcI_c8 (Ouyang et al., 2022, Xie et al., 2024).

Sum S&C MI thus evaluates to a sum of (potentially log-det) terms that share algebraic structure and unit consistency.

3. Optimization: Weighted-Sum Design

The central problem is to maximize (or constrain) the sum S&C MI over waveform or precoder variables, subject to total power constraints:

IcI_c9

where

  • Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c0 admits tractable large-system approximations via random matrix theory, e.g.,

Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c1

with each Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c2 given in closed form involving the eigenstructure of channel covariances and a fixed-point equation for Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c3 (Xie et al., 2024).

  • Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c4 is again log-det in Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c5.

Gradient-projection methods are effective for such problems, based on closed-form gradients for both Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c6 and Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c7. The design can also be posed as a constrained maximization (maximizing Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c8 subject to Jsum=Is+IcJ_{\mathrm{sum}} = I_s + I_c9), which is tackled using ADMM with projections onto the feasible set (Xie et al., 2024).

In weighted-sum settings, a single parameter Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s0 traces out the trade-off surface between SMI and CMI (Peng et al., 2023, Piao et al., 2023). Closed-form solutions can sometimes be obtained via generalized water-filling in the presence of simultaneous log-det objectives.

4. Connection to Classical Sensing Metrics

In the large-system limit, SMI is tightly linked with classical estimation-theoretic performance measures:

Metric Mathematical Connection Reference Section
Sensing MI (Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s1) Information gain over Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s2 (Xie et al., 2024)
MMSE, LMMSE Minimizing error in Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s3 estimation Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s4
Bayesian CRB (EBCRB) Lower bound on Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s5 Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s6
Information–estimation duality Maximizing Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s7 Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s8 minimizing EBCRB (Xie et al., 2024)

This connection explains the operational significance of SMI: maximizing mutual information yields lower parameter uncertainty as measured by (E)CRB, and vice versa.

For both downlink and uplink ISAC, the sum S&C MI metric unifies waveform/precoder design and enables rate-region analysis:

  • Downlink: Joint maximization over sensing and communication waveforms/precoders under total power, with SMI and CMI as joint objectives. Iterative methods (e.g., alternating water-filling, superposition, WMMSE algorithms) yield practical solutions (Ouyang et al., 2022, Peng et al., 2023).
  • Uplink: S&C signals overlap; MI-based metrics characterize rate–rate tradeoff surfaces, and joint optimization strategies include sequential interference cancellation and joint matrix power allocation (Piao et al., 2023).

In all cases, the sum S&C MI captures the achievable region for joint communication and sensing performance, generalizing scalar rate trade-offs to vector-valued policy spaces.

6. Numerical Results and Trade-off Curves

Monte Carlo and asymptotic analyses consistently show:

  • The large-system closed-form SMI is highly accurate (errors Jsum(α)=αIc+(1α)IsJ_{\mathrm{sum}}(\alpha) = \alpha I_c + (1 - \alpha) I_s9 nat for typical α[0,1]\alpha \in [0, 1]0, α[0,1]\alpha \in [0, 1]1).
  • Joint MI-optimizing designs achieve strictly larger SMI for fixed α[0,1]\alpha \in [0, 1]2, and vice versa, than designs optimizing only one objective (Xie et al., 2024, Piao et al., 2023).
  • Weighted-sum MI curves exhibit a convex trade-off ("rate–rate" frontier) as the weighting parameter α[0,1]\alpha \in [0, 1]3 is varied, with maximal α[0,1]\alpha \in [0, 1]4 at an interior value rather than at the endpoints.
  • Practical allocation solutions (water-filling or KKT-based) efficiently balance energy across eigen-modes according to their joint sensing and communication value (Piao et al., 2023).

7. Extensions, Practical Considerations, and Open Problems

  • Computational Efficiency: Log-det and trace formulations admit efficient evaluation and gradient computation. For moderate antenna/channel sizes, second-order methods are practical; for large systems, random-matrix and blockwise computation are critical (Xie et al., 2024).
  • Multi-user and multi-target ISAC: The sum S&C MI framework generalizes to systems with multiple users/targets by summing per-user/target MIs and applying block-diagonal optimization (Peng et al., 2023).
  • Robust/Adaptive Design: Extensions to imperfect CSI, non-Gaussian noise, or robust design are open research problems (Ouyang et al., 2022).
  • Physical Layer Benchmarking: S&C MI provides a rigorous, unit-consistent benchmark for comparing ISAC architectures, as shown by dominance of ISAC rate regions over FDSAC in simulations (Ouyang et al., 2022).
  • Connection to Information–Estimation Dualities: The duality between MI maximization and MMSE/CRB minimization positions S&C MI as a unifying metric for both information-theoretic and estimation-driven ISAC system analysis (Xie et al., 2024).

References: (Ouyang et al., 2022, Peng et al., 2023, Piao et al., 2023, Xie et al., 2024)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Sum S&C Mutual Information (MI).