Sensor configuration and activation for field detection in large sensor arrays
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Detection of Gauss-Markov random fields with nearest-neighbor dependency
IEEE Transactions on Information Theory
| Hi-index | 0.06 |
The determination of the asymptotically efficient importance sampling distribution for evaluating the tail probability P(Ln>u) for large n by Monte Carlo simulations, is considered. It is assumed that Ln is the likelihood ratio statistic for the optimal detection of signal with spectral density sˆ from noise with spectral density cˆ, Ln=(2n)-1Xnt{Tn (cˆ)-1ITn(cˆ+sˆ)-1 }Xn, cˆ and sˆ being both modeled as invertible Gaussian ARMA processes, and Xn being a vector of n consecutive samples from the noise process. By using large deviation techniques, a sufficient condition for the existence of an asymptotically efficient importance sampling ARMA process, whose coefficients are explicitly computed, is given. Moreover, it is proved that such an optimal process is unique