New Importance Sampling Methods for Simulating Sequential Decoders

IEEE Transactions on Information Theory

Volumn 39, Issue 5, 1993, Pages 1716-1722

  Letaief, Khaled Ben ^a   Sadowsky, John S ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b PURDUE UNIVERSITY   (United States)

Author keywords

importance sampling; Sequential decoding

Indexed keywords

ALGORITHMS; DECODING; NUMERICAL ANALYSIS; SAMPLING; SIMULATION; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE;

INFORMATION THEORY;

EID: 0027663484     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.259665     Document Type: Article

References (15)

1. K. B. Letaief, “Importance sampling simulation of the stack algorithm with application to sequential decoding,” Tech. Rep. TR-EE 90–37, School of Elect Eng., Purdue Univ., West Lafayette, IN, 1990.
2. J.-C. Chen, D. Lu, J. S. Sadowsky, and K. Yao, “On importance sampling in digital communications, Part I: Fundamentals; Part II: Trellis Coded Modulation,” to appear in IEEE J. Select. Areas Commun., 1993.
3. P. R. Chevillat and D. J. Costello, Jr., “An analysis of sequential decoding for specific time-invariant convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 443–451, July 1978.
4. G. D. Forney, Jr., “Convolutional codes III: Sequential decoding,” Inform. Contr., vol. 25, pp. 267–297, 1974.
5. D. Haccoun, “A branching process analysis of the average number of computations of the stack algorithm,” IEEE Trans. Inform. Theory, vol. IT-30, no. 3, pp. 497–508, May 1984.
6. I. M. Jacobs and E. R. Berlekamp, “A lower bound to the distribution of computation for sequential decoding,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 167–174, 1967.
7. R. Johannesson, “On the distribution of computation for sequential decoding using the stack algorithm,” IEEE Trans. Inform. Theory, vol. IT-25, no. 3, pp. 323–331, May 1979.
8. R. Johannesson and K. Zigangirov, “On the distribution of the number of computations in any finite number of subtrees for the stack algorithm,” IEEE Trans. Inform. Theory, vol. IT-31, no. 1, pp. 100–102, Jan. 1985.
9. K. L. Jordan, Jr., “The performance of sequential decoding in conjunction with efficient modulation,” IEEE Trans. Commun., vol. COM-14, pp. 283–297, Mar. 1966.
10. J. L. Massey, “Variable-length codes and the Fano metric,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 196–198, 1972.
11. J. S. Sadowsky, “A new method for Viterbi decoder simulation using importance sampling,” IEEE Trans. Commun., vol. 38, no. 9, pp. 1341–1351, Sept. 1990.
12. J. S. Sadowsky and J. A. Bucklew, “On large deviations theory and asymptotically efficient Monte Carlo estimation,” IEEE Trans. Inform. Theory, vol. 36, no. 3, pp. 579–588, May 1990.
13. J. S. Sadowsky, “On the optimality and stability of exponential twisting in Monte Carlo estimation,” IEEE Trans. on Inform. Theory, vol. 39, no. 1, pp. 119–128, Jan. 1993.
14. J. E. Savage, “The distribution of the sequential decoding computation time,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 145–147, 1966.
15. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw Hill, 1979.