An Efficient Low-Complexity Algorithm for MI-Based MIMO ISAC Beamforming Design

The paper investigates MIMO integrated sensing and communication (ISAC) systems with extended radar clutter interference. Different from previous work considering a point target scatterer, we focus on a more general scenario with an extended target scatterer. We aim to maximize the sensing mutual information (MI) while satisfying constraints on communication quality of service (QoS) and base station (BS) transmit power. The existing algorithm exhibits high computational complexity in the general scenario proposed in this paper. Hence, we propose an efficient low-complexity algorithm that employs a parallel optimization strategy and closed-form solutions to significantly reduce the complexity of each iteration. Moreover, we derive a lower bound on sensing MI, which is a function of transmit beampattern, and provide a sufficient condition for its tightness. Numerical results demonstrate the low complexity and good performance of our proposed algorithm compared to the existing benchmarks and validate the relationship between the lower bound and sensing MI.

Authors

Institutions

Publication Details

Published
2025-06-17
DOI
https://doi.org/10.1109/vtc2025-spring65109.2025.11174826
Primary Topic
Advanced MIMO Systems Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Low-Complexity Algorithm for MI-Based MIMO ISAC Beamforming Design

Tantao Gong, Nan Liu, Gui Zhou, Li Jin
Advanced MIMO Systems Optimization
article

An Efficient Low-Complexity Algorithm for MI-Based MIMO ISAC Beamforming Design

Tantao Gong, Nan Liu, Gui Zhou, Li Jin
article en

Abstract

The paper investigates MIMO integrated sensing and communication (ISAC) systems with extended radar clutter interference. Different from previous work considering a point target scatterer, we focus on a more general scenario with an extended target scatterer. We aim to maximize the sensing mutual information (MI) while satisfying constraints on communication quality of service (QoS) and base station (BS) transmit power. The existing algorithm exhibits high computational complexity in the general scenario proposed in this paper. Hence, we propose an efficient low-complexity algorithm that employs a parallel optimization strategy and closed-form solutions to significantly reduce the complexity of each iteration. Moreover, we derive a lower bound on sensing MI, which is a function of transmit beampattern, and provide a sufficient condition for its tightness. Numerical results demonstrate the low complexity and good performance of our proposed algorithm compared to the existing benchmarks and validate the relationship between the lower bound and sensing MI.

Friedrich-Alexander-Universität Erlangen-Nürnberg (DE), Southeast University (CN)
Openalex Percentile: Top 73%
Advanced MIMO Systems Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Efficient Low-Complexity Algorithm for MI-Based MIMO ISAC Beamforming Design — Tantao Gong, Nan Liu, et al. · (2025) | TGRS Research Map | TGRS