A New Method for Viterbi Decoder Simulation Using Importance Sampling

IEEE Transactions on Communications

Volumn 38, Issue 9, 1990, Pages 1341-1351

  Sadowsky, John S ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL COMMUNICATION SYSTEMS--SIMULATION; INFORMATION THEORY--COMMUNICATION CHANNELS; MATHEMATICAL STATISTICS--MONTE CARLO METHODS;

BLOCK CODES; ERROR EVENT SIMULATION; IMPORTANCE SAMPLING; MONTE CARLO ESTIMATION; VITERBI DECODER SIMULATION;

CODES, SYMBOLIC;

EID: 0025493483     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.61375     Document Type: Article

References (21)

1. K. S. Shanmugan and P. Balaban, “A modified Monte Carlo simulation technique for the evaluation of error rate in digital communications systems,” IEEE Trans. Commun., vol. COM-28, pp. 1916–1924, Nov. 1980.
2. R. L. Mitchell, “Importance sampling applied to simulation of false alarm statistics,” IEEE Trans. Aerosp. Electron. Syst., vol. AES-17, 17, pp. 15–24, Jan. 1981.
3. G. W. Lank, “Theoretical aspects of importance sampling applied to false alarms,” IEEE Trans. Inform. Theory, IT-29, pp. 73–82, Jan. 1983.
4. M. C. Jeruchim, “Techniques for estimating the bit error rate in the simulation of digital communications systems,” IEEE J. Select. Areas Commun., vol. SAC-2, 153–170, Jan. 1984.
5. B. R. Davis, “An improved importance sampling method for digital communications system simulations,- IEEE Trans. Commun., vol. COM-34, 715–719, July 1986.
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. D. Lu and K. Yao, “Improved importance sampling technique for efficient simulation of digital communications systems,” IEEE J. Select. Areas Commun., vol. 6, pp. 67–75, Jan. 1988.
8. M. A. Herro and J. M. Nowack, “Simulated Viterbi decoding using importance sampling,” Proc. IEE, vol. 135, part F, pp. 133–142, Apr. 1988.
9. G. Orsak and B. Aazhang, “On the theory of importance sampling applied to the analysis of detection systems,” IEEE Trans. Commun., vol. 37, 332–339, 1989.
10. M. C. 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
11. J. A. Bucklew, P. Ney, and J. S. Sadowsky, “Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains,” J. Appl. Prob., vol. 27, pp. 44–59, Mar. 1990.
12. J. A. Bucklew, P. Ney, and J. S. Sadowsky,“Monte Carlo simulation and large deviations theory for uniformly recurrent Markov chains,” J. Appl. Prob., vol. 27, pp. 44-59, Mar. 1990.
13. V. M. F. Hunkel and J. A. Bucklew, “Fast simulation for functionals of Markov chains,” IEEE Trans. Inform. Theory, to be published.
14. J. S. Sadowsky and J. A. Bucklew, “On large deviations theory and asymptotically efficient Monte Carlo estimation,” IEEE Trans. Inform. Theory, vol. 36, pp. 579-588, May 1990.
15. A. Heller and I. M. Jacobs, “Viterbi decoding for satellite and space communication,” IEEE Trans. Commun., vol. COM-19, pp.835-848, 1971
16. D. Siegmund, “Importance sampling in the Monte Carlo study of sequential tests,” Ann. Statist., vol. 4, pp. 673-684, 1976.
17. P. W. Glynn and D. L. Iglehart,“Importance sampling for stochastic simulations,” Management Sci., vol. 35, pp. 1367- 1392, 1989.
18. J. G. Proakis, Digital Communications. New York: McGraw-Hill, 1983.
19. A. J. Viterbi and J. K. Omura, Principles of Digital Communications and coding: New York: McGaw-Hill, 1979
20. M. Rouanne and D. J. Costello, “An algorithm for computing the distance spectrum of trellis codes,” IEEE J. Select. Areas Commun., vol. 7, pp. 929-940, 1989
21. G. Ungerboeck, “Trellis-coded modulation with redundant signal sets, Part 1: Introduction and Part 2: State of the art,” IEEE Commun. Mag., vol. 25, pp. 5-21, Feb. 1987.