Search arXivSearch

arXiv · 2604.19263

Uplink Signal Detection For Large-Scale MIMO-ISAC Systems

Abstract

Next-generation wireless communication systems are unifying large-scale multiple-input multiple-output (MIMO) and integrated sensing and communication (ISAC) to enhance sensing and communication performance. In this paper, the signal detection problem for MIMO-ISAC systems is modeled as a mixed-integer least squares (MILS) problem. To solve it efficiently, we propose a projection-based neighborhood search-aided alternating direction method of multipliers (P-NS-ADMM) detection scheme. By theoretical analysis, we demonstrate that P-NS-ADMM achieves the same received diversity order as maximum likelihood (ML) detection. For further complexity reduction, an iteration-based NS-ADMM (I-NS-ADMM) is proposed to remove the complex projection operation. Complexity analysis shows its complexity advantage compared with P-NS-ADMM. Moreover, to better estimate the sensing signals for I-NS-ADMM, a flexible mechanism of ADMM iterations is given. Finally, simulations demonstrate the proposed NS-aided ADMM detection schemes have significant performance advantages in terms of both BER and NMSE.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jian Wang, Qiqiang Chen, Zheng Wang, Fan Liu, Yili Xia, Yongming Huang, Chau Yuen. 2026-04-21. Uplink Signal Detection For Large-Scale MIMO-ISAC Systems. https://arxiv.org/abs/2604.19263

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