Abstract
In this paper we study the problem of signal detection in Gaussian noise in a distributed setting where the local machines in the star topology can communicate a single bit of information. We derive a lower bound on the Euclidian norm that the signal needs to have in order to be detectable. Moreover, we exhibit optimal distributed testing strategies that attain the lower bound.
Original language | English |
---|---|
Article number | 9709332 |
Pages (from-to) | 4070-4084 |
Number of pages | 15 |
Journal | IEEE Transactions on Information Theory |
Volume | 68 |
Issue number | 6 |
DOIs | |
Publication status | Published - 2022 |
Bibliographical note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-careOtherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Keywords
- distributed algorithms
- Gaussian noise
- hypothesis testing
- minimax lower bounds
- Testing