M-path decoder with algebraic metric calculation

Author

Alie, Martin ; Belzile, Jean ; Thibeault, Claude

Author_Institution

Dept. of Electr. Eng., Montreal Higher Technol. Sch., Que., Canada

Volume

1

fYear

1995

Firstpage

225

Abstract

The authors propose a modification of the M-path convolutional code decoding algorithm in order to improve its performance. Due to nonexhaustive exploration of the trellis, the M-path algorithm is a suboptimal decoding algorithm. On the other hand, this elimination of certain paths from the trellis reduces its complexity in comparison with the Viterbi algorithm. The proposed modification adds to the traditional calculation of the branch metric an algebraic metric representing an estimate of the number of future symbol errors. By this new metric the performance of the M-path decoder is improved by about 0.5 dB

Keywords

algebra; coding errors; computational complexity; convolutional codes; decoding; error analysis; trellis codes; 0.5 dB; M-path decoder; algebraic metric calculation; branch metric; complexity; convolutional code decoding algorithm; future symbol errors; performance; suboptimal decoding algorithm; trellis; Circuits; Convolutional codes; Decoding; Irrigation; Performance gain; Very large scale integration; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical and Computer Engineering, 1995. Canadian Conference on

Conference_Location

Montreal, Que.

ISSN

0840-7789

Print_ISBN

0-7803-2766-7

Type

conf

DOI

10.1109/CCECE.1995.528115

Filename

528115