Subspace Fusion Sensing for Cooperative ISAC

TL;DR

A data association-free subspace-based fusion sensing algorithm is developed utilizing the EVA arrays from distributed APs, and a derivation of Cramer-Rao lower bound is presented.

Abstract

This paper proposes a subspace fusion sensing algorithm for cooperative integrated sensing and communication. First, we stack the received signals from access points (APs) into a third-order tensor and construct the equivalent virtual antenna (EVA) array via tensor unfolding. Then, a data association-free subspace-based fusion sensing algorithm is developed utilizing the EVA arrays from distributed APs. A derivation of Cramer-Rao lower bound (CRLB) is also presented. Finally, simulation results validate the effectiveness of the proposed algorithm compared to traditional techniques.

Figures (4)

• Figure 1: cooperative ISAC system.
• Figure 2: Illustration of (a) EVA array construction and (b) local and global coordinate systems at the AP.
• Figure 3: Cost function of the proposed algorithm.
• Figure 4: Square root of the CRLB and estimated RMSE as a function of (a) the SNR and (b) number of targets.