On the Performance of Sequential and Viterbi Decoders for High-Rate Punctured Convolutional Codes

IEEE Transactions on Communications

Volumn 43, Issue 11, 1995, Pages 2687-2695

  Muhammad, K ^a   Letaief, Khaled Ben ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

importance sampling; Punctured convolutional codes; sequential and Viterbi decoding

Indexed keywords

DISPARITY; IMPORTANCE SAMPLING; PUNCTURED CONVOLUTIONAL CODES; SEQUENTIAL DECODERS; VITERBI DECODERS;

BIT ERROR RATE; CODING ERRORS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DECODING; ERROR CORRECTION; PERFORMANCE; PROBABILITY;

CONVOLUTIONAL CODES;

EID: 0029409494     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.481219     Document Type: Article

References (14)

1. G. Bégin and D. Haccoun, “Comparison and analysis of Fano and stack sequential decoding of high-rate punctured convolutional codes,” in Proc. of the IEEE Int. Symp. Information Theory, Budapest, Hungary, June 1991.
2. D. Haccoun and G. Bégin, “High-rate punctured convolutional codes for Viterbi and sequential decoding,” IEEE Trans. Commun., vol. 37, pp. 1113–1125, Nov. 1989.
3. S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
4. G. C. Clark, J. B. Cain, and J. M. Giest, “Punctured convolutional codes of rate (n - 1)/n and simplified maximum likelihood decoding,” IEEE Trans. Inform. Theory, vol. IT-25, no. 1, pp. 97–100, Jan. 1979.
5. K. Kashiki, Y. Yasuda, and Y. Hirata, “High-rate punctured convolutional codes for soft decision Viterbi decoding,” IEEE Trans. Commun., vol. COM-32, pp. 315–319, Mar. 1984.
6. P. R. Chevillat and D. J. Costello, “An analysis of sequential decoding for specific time-invariant convolutional codes,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 443–451, July 1978.
7. D. Haccoun, G. Bégin, and C. Paquin, “Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding,” IEEE Trans. Commun., vol. 38, no. 11, pp. 1922–1928, Nov. 1990.
8. K. Ben Letaief and J. S. Sadowsky “Computing bit error probabilities for avalanche photodiodes using large deviations theory,” IEEE Trans. Inform. Theory, vol. 38, no. 3, pp. 1162–1169, May 1992.
9. D. Lu and K. Yao, “Improved importance sampling technique for efficient simulation of digital communication systems,” IEEE J. Select. Areas Commun., vol. 6, no. 1, pp. 67–75, Jan. 1988.
10. K. Ben Letaief and J. S. Sadowsky, “New importance sampling methods for simulating sequential decoders performance,” IEEE Trans. Inform. Theory, vol. 39, no. 5, pp. 1716–1722, Sept. 1993.
11. K. Ben Letaief and K. Muhammad, “An efficient new technique for accurate bit error probability estimation of ZJ decoders,” IEEE Trans. Commun., vol. 43, no. 6, pp. 2020–2027, June 1995.
12. J. L. Massey and M. K. Sain, “Trunk and tree searching properties of the Fano sequential decoding algorithm,” in Proc. 6th Annual Allerton Conf., 1968, pp. 153–160, 1968.
13. J. M. Giest, “Search properties of some sequential decoding algorithms,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 519–526, July 1973.
14. 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.