Performance Evaluation of the M-algorithm for Decoding Convolutional Codes 


Vol. 27,  No. 3, pp. 188-195, Mar.  2002


PDF
  Abstract

The M-algorithm for decoding convolutional codes can significantly reduce the complexity of the Viterbi algorithm by tracking a fixed number of survivor paths in each level of the decoding trellis. It is an easily-implementable algorithm suited for real-time processing of high-speed data. The algorithm, however, generates a sequence of catastrophic errors when the correct path is not included in the set of survivor paths. In this paper, the performance of the M-algorithm obtained from using various decoding complexity levels, frame lengths, and code constraint lengths is presented. The performance gain is quantified when the algorithm is used in conjunction with codes of increased constraint length. In particular, it is demonstrated the gain from the increased code free distance overcompensates the loss from the correct path being excluded from the survivors, when the frame length is short to moderate. Using 64 survivor paths, the signal-to-noise ratio gain obtained by increasing the constraint length from K = 7 to K = 9, 11, 15 is respectively 0.6, 0.75, and 0.8dB, when the frame of length L = 100 has the frame error rate of 0.01%.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Chun, K. Choi, W. Sung, "Performance Evaluation of the M-algorithm for Decoding Convolutional Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 3, pp. 188-195, 2002. DOI: .

[ACM Style]

Jinyoung Chun, Kyuho Choi, and Wonjin Sung. 2002. Performance Evaluation of the M-algorithm for Decoding Convolutional Codes. The Journal of Korean Institute of Communications and Information Sciences, 27, 3, (2002), 188-195. DOI: .

[KICS Style]

Jinyoung Chun, Kyuho Choi, Wonjin Sung, "Performance Evaluation of the M-algorithm for Decoding Convolutional Codes," The Journal of Korean Institute of Communications and Information Sciences, vol. 27, no. 3, pp. 188-195, 3. 2002.