Rational rate punctured convolutional codes for soft-decision viterbi decoding

IEEE Transactions on Information Theory

Volumn 43, Issue 4, 1997, Pages 1305-1313

  Bocharova, Irina E ^a   Kudryashov, Boris D ^a  

^a SAINT PETERSBURG STATE UNIVERSITY OF AEROSPACE INSTRUMENTATION   (Russian Federation)

Author keywords

Maximum likelihood decoding complexity; Punctured convolutional codes

Indexed keywords

CONSTRAINT THEORY; DECODING; TRELLIS CODES;

MAXIMUM LIKELIHOOD DECODING COMPLEXITY; SOFT DECISION VITERBI DECODING;

CONVOLUTIONAL CODES;

EID: 0031188042     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.605600     Document Type: Article

References (13)

1. J. B. Cain, G. C. Clark, Jr., and J. M. Geist, "Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding," IEEE Trans. Inform. Theory, vol. IT-25, pp. 97-100, Jan. 1979.
2. K. J. Hole, "New short constraint length rate (N - 1)/N punctured convolutional codes for soft-decision Viterbi decoding," IEEE Trans. Inform. Theory, vol. 34, pp. 1079-1081, Sept. 1988.
3. Y. Yasuda, K. Kashiki, and Y. Hirata, "High-rate convolutional codes for soft decision Viterbi decoding," IEEE Trans. Commun., vol. COM-32, pp. 315-319, Mar. 1984.
4. D. Haccoun and G. Begin, "Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding," IEEE Trans. Commun., vol. 38, pp. 1922-1929, Nov. 1990.
5. P. J. Lee, "Constructions of rate (n - 1)/n punctured convolutional codes with minimal required SNR criterion," IEEE Trans. Commun., vol. 36, pp. 1171-1173, Oct. 1988.
6. D. G. Daut, J. W. Modestino, and L. D. Wismer, "New short constraint length convolutional codes constructions for selected rational rates," IEEE Trans. Inform. Theory, vol. IT-28, pp. 794-800, Sept. 1982.
7. V. B. Balakirsky, "Estimations of transfer functions of noncatastrofic convolutional encoders," IEEE Trans. Inform. Theory, vol. 42, pp. 1014-1021, May 1996.
8. A. N. Trofimov and B. D. Kudryashov, "Distance spectra and upper bounds on error probability for trellis codes," IEEE Trans. Inform. Theory, vol. 41, pp. 561-572, Mar. 1995.
9. M. Mooser, "Some periodic convolutional codes better than any fixed code," IEEE Trans. Inform. Theory, vol. IT-29, pp. 750-751, Sept. 1983.
10. P. J. Lee, "There are many good periodically time-varying convolutional codes," IEEE Trans. Inform. Theory, vol. 35, pp. 460-463, Mar. 1989.
11. R. Palazzo, "A time-varying convolutional encoder better than the best time-invariant encoder," IEEE Trans. Inform. Theory, vol. 39, pp. 1109-1110, May 1993.
12. K. J. Larsen, "Short convolutional codes with maximal free distance for rates 1/2, 1/3 and 1/4," IEEE Trans. Inform. Theory, vol. IT-19, pp. 371-373, May 1973.
13. J. P. Odenwalder, "Optimal decoding of convolutional codes," Ph.D. dissertation, Dept. Elec. Eng., Univ. of California, Los Angeles, Jan. 1970.