Error bound for reduced-state Viterbi decoding of TCM codes

IEEE Communications Letters

Volumn 3, Issue 9, 1999, Pages 266-268

  Simmons, Stanley J ^a  

^a QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECODING; ERROR ANALYSIS;

REDUCED-STATE VITERBI DECODING; TRELLIS CODED MODULATION (TCM) CODES;

TRELLIS CODES;

EID: 0033361377     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/4234.784582     Document Type: Article

References (5)

1. D. W. Matolak and S. G. Wilson, "Variable complexity trellis decoding of binary convolutional codes," IEEE Trans. Commun., vol. 44, pp. 121-126, Feb. 1996.
2. E. Biglieri, D. Divsalar, P. J. McLane, and M. K. Simon, Introduction to Trellis-Coded Modulation with Applications. New York: MacMillan, 1991.
3. E. Biglieri and P. J. McLane, "Uniform distance and error probability properties of TCM schemes," IEEE Trans. Commun., vol. 39, pp. 41-53, Jan. 1991.
4. C. Schlegel and D. J. Costello, "Bandwidth efficient coding for fading channels: code construction and performance analysis," IEEE J. Select. Areas Commun., vol. 7, pp. 1356-1368, Dec. 1989.
5. S. J. Simmons, "A low-power-consumption decoding strategy for personal communications mobiles," in Proc. IEEE PACRIM'97, Victoria, BC, Canada, Aug. 1997.