Comparisons are made of a genie-aided sequential algorithm due to D. Haccoun and M.J. Ferguson (1975), the Viterbi algorithm, the M-algorithm, and the Fano algorithm for rate-1/2 and rate-2/3 trellis modulation codes on rectangular signal sets. The effects of signal-to-noise ratio and decoding-delay constraints on the choice of decoding algorithms for framed data are examined by computer simulation. Additionally, the genie-aided algorithm is used as a tool in estimating the asymptotic behavior of the M-algorithm. In general, the results conform closely to experience with convolutional codes due to the similar distance structure of the codes. The Fano algorithm produces good error performance with a low average number of computations when long decoding delay is permissible. The M-algorithm provides a savings in computation compared to the Viterbi algorithm if a small decoding delay is required.>
No takes yet. Share an insight, caveat, or question.
Pottie et al. (1989) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: