Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 3, Issue , 2003, Pages 1741-1745

  Kurkoski, Brian M ^a   Siegel, Paul H ^a   Wolf, Jack K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DECODING; ERROR ANALYSIS; MARKOV PROCESSES; POLYNOMIALS; PROBABILITY; TURBO CODES; VECTORS;

BINARY ERASURE CHANNEL (BEC); DECODING ALGORITHMS;

CONVOLUTIONAL CODES;

EID: 0842289217     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. K. E. Tepe and J. B. Anderson, "Turbo codes for binary symmetric and binary erasure channels," in Proceedings of IEEE International Symposium on Information Theory, (Cambridge, MA), p. 59, IEEE, August 1998.
2. C. Méasson and R. Urbanke, "Further analytic properties of EXIT-like curves and applications," in Proceedings of IEEE International Symposium on Information Theory, (Yokohama, Japan), p. 266, IEEE, July 2003.
3. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A soft-input soft-output APP module for iterative decoding of concatenated codes," IEEE Communications Letters, vol. 1, pp. 22-24, January 1997.
4. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Transactions on Information Theory, vol. 20, pp. 284-287, March 1974.
5. M. Lentmaier, D. Truhachev, and K. S. Zigangirov, "Analytic expression for the exact bit error probability of the (7,5) convolutional code," in Proceedings of IEEE International Symposium on Information Theory, (Lausanne, Switzerland), p. 7, IEEE, June 2002.
6. M. R. Best, M. V. Burnashev, Y. Levy, A. Rabinovich, P. C. Fishburn, A. R. Calderbank, and J. Daniel J. Costello, "On a technique to calculate the exact performance of a convolutional code," IEEE Transactions on Information Theory, vol. 41, pp. 441-441, March 1995.
7. T. N. Morrissey, "A Markovian analysis of Viterbi decoders for convolutional codes," in Proceedings of National Electronics Conference, pp. 303-307, Oct 1969.
8. H. D. Pfister, On the Capacity of Finite State Channels and the Analysis of Convolutional Accumulate-m Codes. PhD thesis, University of California, San Diego, La Jolla, CA, USA, March 2003.
9. G. W. Stewart, "Gaussian elimination, perturbation theory, and Markov chains," in Linear Algebra, Markov Chains, and Queuing Models, (New York, NY, USA), pp. 59-69, Springer-Verlag, 1992.
10. J. P. M. Schalkwijk and A. J. Vinck, "Syndrome decoding of convolutional codes," IEEE Transactions on Communications, vol. 23, pp. 789-792, July 1975.