Extremum-Based Joint Compression and Detection for Distributed Sensing
Abstract
We study joint compression and detection in distributed sensing systems motivated by emerging applications such as IoT-based localization. Two spatially separated sensors observe noisy signals and can exchange only a k-bit message over a reliable one-way low-rate link. One sensor compresses its observation into a k-bit description to help the other decide whether their observations share a common underlying signal or are statistically independent. We propose a simple extremum-based strategy, in which the encoder sends the index of its largest sample and the decoder performs a scalar threshold test. We derive exact nonasymptotic false-alarm and misdetection probabilities and validate the analysis with representative simulations.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.