Searcharxiv⌕ Search

arXiv · 2610.36351

On the Fundamental Limits of Bistatic ISAC Over Vector Channels

Abstract

This paper studies the fundamental limits of bistatic integrated sensing and communications (ISAC) systems over vector channels. We first consider a class of parallel channels in which, on each component channel, the channel from the transmitter (Tx) to the communication receiver (Rx) is degraded with respect to the channel from the Tx to the sensing Rx, or vice versa, where the direction of degradation may vary across component channels. For this class of channels, we establish matching achievability and converse results, which yield a single-letter characterization of the capacity-distortion function $C(D)$. For parallel Gaussian channels with additive Gaussian states, the evaluation of the capacity-distortion-power function $C(D,P)$ under the squared error distortion measure reduces to a joint power and distortion allocation problem across the component channels. We then extend the analysis to general vector channels and derive single-letter lower and upper bounds on $C(D)$. In particular, for vector Gaussian channels with additive Gaussian states, we prove the optimality of Gaussian superposition coding without requiring a global degradation order between the communication and sensing channels, by combining the channel enhancement technique with a matrix extremal inequality based on Fisher information. This leads to an exact characterization of $C(D,P)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dongsheng Peng, Lei Yu, Ping Chen, Jun Chen. 2026-10-26. On the Fundamental Limits of Bistatic ISAC Over Vector Channels. https://arxiv.org/abs/2610.36351

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

KEEP EXPLORING

Related papers

Pinching Antenna and Relay Assisted Joint Indoor Outdoor NOMA Communications with SWIPT

This paper presents a unified downlink architec- ture for serving indoor and outdoor users from a shared multi-antenna rooftop base station (BS). To overcome severe building-penetration loss, the BS transfers information and radio- frequency (RF) energy to an indoor access point (AP) using simultaneous wireless information and power transfer (SWIPT). The AP harvests this energy and performs amplify-and-forward (AF) relaying, enabling self-sustained indoor communication. A movable waveguide-mounted pinching antenna (PA) further improves indoor coverage by adapting its position to the prop- agation environment. For outdoor transmission, zero-forcing (ZF) beamforming suppresses inter-group interference, while power-domain non-orthogonal multiple access (NOMA) supports multiple users within each group. We maximize the outdoor weighted sum rate (WSR) while satisfying stringent indoor and outdoor quality-of-service (QoS) requirements. The resulting nonconvex problem jointly optimizes the BS power fraction, SWIPT power-splitting ratio, PA position, and NOMA power allocation. To obtain an efficient solution, we develop a two-stage method based on alternating optimization (AO) and sequential quadratic programming (SQP). Numerical results show that the proposed architecture improves outdoor spectral efficiency while maintaining reliable, energy-sustainable indoor coverage. Increasing the BS array size further raises the indoor QoS- satisfaction probability toward unity, even under demanding rate targets.

cs.IT↗

Local Differential Privacy for Molecular Communication Networks

Molecular communication (MC) enables information exchange in nanoscale sensor networks operating in biological environments, yet privacy remains largely unaddressed. We integrate local differential privacy (LDP) into diffusion-based MC by privatizing each user's measurement at the transmitter and conveying the resulting randomized report over the MC channel. To our knowledge, this is the first systematic LDP implementation for diffusion-based MC, enabling privacy-preserving aggregate data analysis for in-body health monitoring and other population-scale sensing applications. We benchmark major LDP mechanisms under a realistic channel model. Simulation results show that Optimized Local Hashing (OLH) achieves the lowest average $\ell_1$ distribution-estimation error under the MC channel when channel resources are sufficient and the number of possible user values (alphabet size) $k$ is moderate to large, whereas k-ary Randomized Response (KRR) and, for privacy budget $ε=1$, Binary Local Hashing (BLH), which have shorter reports, are more robust as the MC transmission quality deteriorates. We further propose RLIM-LDP, which combines run-length-limited ISI-mitigation (RLIM) coding with LDP coding. Extensive simulation results demonstrate that RLIM-LDP improves end-to-end reliability and reduces the final distribution-estimation error when time and molecule resources are limited.

cs.IT↗

Hierarchical Joint Source-Channel Coding with Constrained Information Leakage

This paper studies the hierarchical joint source-channel coding with information leakage constraint in the first-phase reconstruction and distortion constraints. The receiver's access to the data varies and is evaluated by the quality of the side information. Due to the consideration of channel capacity limitation or the efficiency of the system performance, the encoder may send some additional information in Phase 1 that can only be decoded in Phase 2 with higher-quality side information. While this can optimize the overall performance, the additional information causes excessive information leakage. We provide general inner and outer bounds for the conditions such that a given distortion-leakage pair $(D_1,D_2,L)$ is achievable, together with a capacity-achieving condition.

cs.IT↗