On Large Deviations Theory and Asymptotically Efficient Monte Carlo Estimation

IEEE Transactions on Information Theory

Volumn 36, Issue 3, 1990, Pages 579-588

  Sadowsky, John S ^a   Bucklew, J A ^b  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL COMMUNICATION SYSTEMS--COMPUTER SIMULATION; MATHEMATICAL STATISTICS--MONTE CARLO METHODS; SAMPLING; TELECOMMUNICATION LINKS, SATELLITE--COMPUTER SIMULATION;

IMPORTANCE SAMPLING; INTERSYMBOL INTERFERENCE; LARGE DEVIATIONS THEORY; MONTE CARLO ESTIMATION; MONTE CARLO SIMULATION;

COMPUTER SIMULATION;

EID: 0025432132     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.54903     Document Type: Article

References (19)

1. J. A. Bucklew, P. New, and J. S. Sadowsky, “Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains,” J. Appl. Probab, Mar. 1990.
2. M. Cottrell, J.-C. Fort, and G. Malgouyres, “Large deviations and rare events in the study of stochastic algorithms,” IEEE Trans. Automat. Contr., vol. AC-28, pp. 907–920, Sept. 1983.
3. P. Dupuis and H. J. Kushner, “Stochastic systems with small noise, analysis and simulation; a phase locked loop example,” SIAM J. Appl. Math., vol. 47, pp. 643–661, June 1987.
4. R. S. Ellis, “Large deviations for a general class of random vectors,” Ann. Probab., vol. 12, pp. 1–12 1984.
5. J. Gartner, “On large deviations from the invariant measure,” Theory Probab. Appl., vol. 22, pp. 24–39, 1977.
6. P. M. Hahn and M. C. Jeruchim, “Developments in the theory and application of importance sampling,” IEEE Trans. Commun., vol. COM-35, pp. 706–714, July 1987.
7. J. M. Hammersley and D. C. Handscomb, Monte Carlo Methods. New York: and Hall, 1964.
8. V. M. F. Hunkel and J. A. Bucklew, “Fast simulation for functionals of Markov chains,” in Proc. 1988 Conf. Inform. Sci. Syst. (Princeton, NJ), Mar. 1988, pp. 319–324.
9. M. J. Jeruchim, P. M. Hahn, K. P. Smyntek and R. T. Ray, “An experimental investigation of conventional and efficient importance sampling,” IEEE Trans. Commun., vol. 37, pp. 578–587, June 1989.
10. D. Lu and K. Yao, “Improved importance sampling technique for efficient simulation of digital communications systems,” IEEE J. Selected Areas Commun., pp. 67–75, 1988.
11. D. G. Luenberger, Introduction to Linear and Nonlinear Programming. Reading MA: Addison-Wesley, 1965.
12. S. Parekh and J. Walrand, “A quick simulation method for excessive backlogs in networks of queues,” IEEE Trans. Automat. Contr., vol. 34, pp. 54–66, Jan. 1989.
13. P. Ney, “Dominating points and the asymptotics of large deviations for random walks on R‘V’ Ann. probab., vol. 11, pp. 158–167, 1983.
14. J. S. Sadowsky and J. A. Bucklew, “Large deviations theory techniques in Monte Carlo simulation,” in Proc. 1989 Winter Sim. Conf. (Washington, DC), Dec. 1989.
15. J. S. Sadowsky “A new method for Viterbi decoder simulation using importance sampling,” to be published in IEEE Trans. Commun.
16. J. S. Sadowsky, “Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queue,” to be published in IEEE Trans. Automat. Contr.
17. J. S. Sadowsky and R. K. Bahr, “Direct sequence spread spectrum multiple access communications with random signature sequences: A large deviations analysis,” to be published in IEEE Trans. Inform Theory.
18. D. Siegmund “Importance sampling in the Monte Carlo study of sequential tests,” Ann. Statis., vol. 4, pp. 673–684, 1976.
19. A. E. Wessel, E. B. Hall, and G. L. Wise, “Some comments on importance sampling,” in Proc. 1988 Conf. Inform. Sci. Syst., Princeton Univ., Princeton, NJ, Mar. 1988, pp. 325–329.