Transactions Papers: An Efficient New Technique for Accurate Bit Error Probability Estimation of ZJ Decoders

IEEE Transactions on Communications

Volumn 43, Issue 6, 1995, Pages 2020-2027

  Letaief, Khaled Ben ^a   Muhammad, Khurram ^b  

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

^b R&D Section Carrier Telephone Industries ^*  (Pakistan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMPUTER SIMULATION; CONVOLUTIONAL CODES; DIGITAL COMMUNICATION SYSTEMS; ESTIMATION; PROBABILITY DENSITY FUNCTION; SAMPLING;

IMPORTANCE SAMPLING; MODIFIED ERROR EVENT SIMULATION; ZIGANGIROV JELINEK DECODERS;

DECODING;

EID: 0029323472     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.387442     Document Type: Article

References (18)

1. K. Zigangirov, “On the error probability of sequential decoding on the BSC,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 199–202, Jan. 1972.
2. J. M. Giest, “Search properties of some sequential decoding algorithms,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 519–526, July 1973.
3. G. D. Forney, Jr., “Convolutional codes III: Sequential decoding,” Inform. and Contr., vol. 25, pp. 267–297, 1974.
4. 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.
5. A. J. Viterbi and J. K. Omura, “Principles of digital communication and coding,” McGraw Hill, New York, 1979.
6. S. Lin and D. J. Costello, Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
7. D. Haccoun, “A branching process analysis of the average number of computations of the stack algorithm,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 497–508, May 1984.
8. J. B. Anderson “Sequential decoding based on error criterion,” IEEE Trans. Inform. Theory, vol. IT-38, pp. 987–1001, May 1992.
9. K. B. Letaief and J. S. Sadowsky, “New importance sampling methods for simulating sequential decoders performance,” IEEE Trans. Inform. Theory, vol. 39, pp. 1716–1722, Sept. 1993.
10. M. A. Herro and J. M. Nowack, “Simulated Viterbi decoding using importance sampling,” IEE Proc.- Part I, pp. 133–142, Apr. 1988.
11. K. S. Shanmugam and P. Balaban, “A modified Monte Carlo simulation technique for the evaluation of error rate in digital communication systems,” IEEE Trans. Common., vol. COM-28, pp. 1916-1924, Nov. 1989.
12. K. Muhammad and K. Ben Letaief, “On the performance of sequential and Viterbi decoders for high-rate punctured convolutional codes,” IEEE Trans. Commun., to be published.
13. J. S. Sadowsky, “A new method for Viterbi decoder simulation using importance sampling,” IEEE Trans. Commun., vol. 38, pp. 1341–1351, Sept. 1990.
14. D. Lu and K. Yao, “Estimation variance bounds of importance sampling simulations in digital communication systems,” IEEE Trans. Commun., vol. COM-39, no. 10, pp. 1413–1417, Oct. 1991.
15. M. Fratter, T. M. Lennon, and B. D. Anderson, “Optimally efficient estimation of the statistics of rare events in queuing networks,” IEEE Trans. Automat. Contr., vol. AC-36, pp. 1395–1405, Dec. 1991.
16. G. Orsak and B. Aazhang, “Efficient importance sampling techniques for simulation of multiuser communication systems,” IEEE Trans. Commun., vol. 40, pp. 1111–1118, June 1992.
17. K. B. Letaief, “The performance of optical fiber direct sequence spread-spectrum multiple-access communications systems,” IEEE Trans. Commun., to be published.
18. J. S. Sadowsky, “On the optimality and stability of exponential twisting in Monte Carlo estimation,” IEEE Trans. Inform. Theory, vol. 39, pp. 119–128, Jan. 1993.