A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization
We consider a distributed binary hypothesis testing setup where multiple nodes send quantized information to a central processor, which is oblivious to the nodes' statistics. We study the regime where the missed detection (type-II error) probability decays exponentially and the false alarm (type-I error) probability vanishes. For memoryless quantization, we characterize a tradeoff curve that yields a lower bound for the feasible region of type-II error exponents and the average number of bits sent under the null hypothesis. Moreover, we show that the tradeoff curve is approached at high rates with lattice quantization.
WOS:000864709905003
2022-01-01
New York
978-1-5386-8347-7
IEEE International Conference on Communications
4824
4829
REVIEWED
EPFL
Event name | Event place | Event date |
Seoul, SOUTH KOREA | May 16-20, 2022 | |