Computer Science – Information Theory
Scientific paper
2010-03-15
Computer Science
Information Theory
11 pages, 2 figures, presented at ITW 2010
Scientific paper
10.1109/ITWKSPS.2010.5503209
This paper investigates the decentralized detection of Hidden Markov Processes using the Neyman-Pearson test. We consider a network formed by a large number of distributed sensors. Sensors' observations are noisy snapshots of a Markov process to be detected. Each (real) observation is quantized on log2(N) bits before being transmitted to a fusion center which makes the final decision. For any false alarm level, it is shown that the miss probability of the Neyman-Pearson test converges to zero exponentially as the number of sensors tends to infinity. The error exponent is provided using recent results on Hidden Markov Models. In order to obtain informative expressions of the error exponent as a function of the quantization rule, we further investigate the case where the number N of quantization levels tends to infinity, following the approach developed in [Gupta & Hero, 2003]. In this regime, we provide the quantization rule maximizing the error exponent. Illustration of our results is provided in the case of the detection of a Gauss-Markov signal in noise. In terms of error exponent, the proposed quantization rule significantly outperforms the one proposed by [Gupta & Hero, 2003] for i.i.d. observations.
Bianchi Pascal
Moulines Eric
Piantanida Pablo
Villard Joffrey
No associations
LandOfFree
High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov Processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-Rate Quantization for the Neyman-Pearson Detection of Hidden Markov Processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-214372