论文信息 - Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains

Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains

We address the problem of complexity reduction in state estimation of Poisson processes modulated by continuous-time nearly completely decomposable Markov chains.

Vikram Krishnamurthy | Subhrakanti Dey | V. Krishnamurthy | S. Dey

[1] J. M. Clark. The Design of Robust Approximations to the Stochastic Differential Equations of Nonlinear Filtering , 1978 .

[2] N. Mitrou,et al. Markov-modulated traffic with nearly complete decomposability characteristics and associated fluid queueing models , 1995, Advances in Applied Probability.

[3] Subhrakanti Dey,et al. Reduced-complexity filtering for partially observed nearly completely decomposable Markov chains , 2000, IEEE Trans. Signal Process..