Search arXivSearch

arXiv · 2604.27571

Harnessing the Freedom of Non-Uniformity in Monostatic ISAC with Antenna Flexibility

Abstract

This paper studies flexible non-uniform array design for monostatic integrated sensing and communication (ISAC) systems. An antenna pool is considered at the base station, where each candidate antenna can be dynamically assigned to transmit, receive, or inactive modes, such that a non-uniform effective array is jointly constructed with the ISAC precoding design. We formulate a sum communication rate maximization problem by jointly optimizing the ISAC beamforming schemes and antenna-mode assignment under sensing, power, and antenna mode constraints. We develop an alternating-optimization-based solution framework mainly with the aid of weighted minimum mean square error, continuous relaxation-based penalty, and successive convex approximation. Numerical results show that the proposed non-uniform array achieves higher sum-rates than the uniform-array baselines, with particularly large gains when the number of activated antennas is small. Moreover, the proposed non-uniform array can achieve, and in some cases exceed, the performance of uniform array baselines with substantially fewer activated antennas, highlighting geometry-aware non-uniform array design as a compelling alternative to brute-force antenna scaling-based array design.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhe Wang, Mahmoud Zaher, Vitaly Petrov, Emil Björnson. 2026-04-30. Harnessing the Freedom of Non-Uniformity in Monostatic ISAC with Antenna Flexibility. https://arxiv.org/abs/2604.27571

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT