Sparse Array Sensor Selection in ISAC with Identifiability Guarantees
원문 초록
This paper investigates array geometry and waveform design for integrated sensing and communications (ISAC) employing sensor selection. We consider ISAC via index modulation, where various subsets of transmit (Tx) sensors are used for both communications and monostatic active sensing. The set of Tx subarrays make up a codebook, whose cardinality we maximize (for communications) subject to guaranteeing a desired target identifiability (for sensing). To characterize the size of this novel optimal codebook, we derive first upper and lower bounds, which are tight in case of the canonical uniform linear array (ULA) and any nonredundant array. We show that the ULA achieves a large codebook - comparable to the size of the conventional unconstrained case - as satisfying the identifiability constraint only requires including two specific sensors in each Tx subarray (codeword). In contrast, nonredundant arrays, which have the largest identifiability for a given number of physical sensors, only have a single admissible codeword, rendering them ineffectual for communications via sensor selection alone. The results serve as a step towards an analytical understanding of the limits of sensor selection in ISAC and the fundamental trade-offs therein.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Chirp Delay-Doppler Domain Modulation: A New Paradigm of Integrated Sensing and Communication for Autonomous Vehicles
ISAC: An Invertible and Stable Auditory Filter Bank with Customizable Kernels for ML Integration
PLAIN: Scalable Estimation Architecture for Integrated Sensing and Communication
High-Resolution Uplink Sensing in Millimeter-Wave ISAC Systems
CISSIR: Beam Codebooks with Self-Interference Reduction Guarantees for Integrated Sensing and Communication Beyond 5G
Unsupervised Learning for Gain-Phase Impairment Calibration in ISAC Systems
토론
이 논문과 연결된 포럼 글이 아직 없습니다.