Skip to main content
Log in

A Maximum Likelihood Decoding Algorithm for Wireless Channels

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

A new maximum likelihood decoding (MLD) algorithm for linear block codes is proposed. The new algorithm uses the algebraic decoder in order to generate the set of candidate codewords. It uses the exact probability for each codeword as a new likelihood metric and a method to generate the appropriate set of codewords similar to Kaneko, et al., and Tanaka-Kakigahara algorithms. The performance of the proposed algorithm is the same as that of MLD as it is proved theoretically and verified by simulation results. The comparison with these similar algorithms shows that the new one always requires less average decoding complexity than those of the other algorithms. Finally, we compare the algorithms for terrestrial and satellite channels.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. K. Wolf, “Efficient Maximum Likelihood Decoding of Block Codes Using a Trellis”, IEEE Trans. Inform. Theory, Vol. 24, pp. 76–80, 1978.

    Google Scholar 

  2. R. Bahl, J. Cocke, F. Jelinek and J. Raviv, “Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate”, IEEE Trans. Inform. Theory, Vol. 20, pp. 284–287, 1974.

    Google Scholar 

  3. D. Forney, “Generalized Minimum Distance Decoding”, IEEE Trans. Inform. Theory, Vol. IT-12, pp. 125–131, 1966.

    Google Scholar 

  4. Tanaka and K. Kakigahara, “Simplified Correlation Decoding by Selecting Possible Codewords Using Erasure Information”, IEEE Trans. Inform. Theory, Vol. IT-29, No. 5, pp. 743–748, 1983.

    Google Scholar 

  5. Kaneko, T. Nishijima, H. Inazumi and S. Hirasawa, “An Efficient Maximum-likelihood-decoding Algorithm for Linear Block Codes with Algebraic Decoder”, IEEE Trans. Inform. Theory, Vol. 40, No, 2, pp. 320–327, 1994.

    Google Scholar 

  6. Gazelle and J. Snyders, “Reliability-based Code-search Algorithms for Maximum-likelihood Decoding of Block Codes”, IEEE Trans. Inform. Theory, Vol. 43, No. 1, pp. 239–249, 1997.

    Google Scholar 

  7. T. Moorthy, S. Lin and T. Kasami, “Soft-Decision Decoding of Binary Linear Block Codes Based on an Iterative Search Algorithm”, IEEE Trans. Inform. Theory, Vol. 43, No. 3, pp. 1030–1040.

  8. J. Taipale and M.B. Purlsey, “An Improvement to Generalized-minimum Distance Decoding”, IEEE Trans. Inform. Theory, Vol. 37, No. 1, pp. 167–172, 1991.

    Google Scholar 

  9. Suzuki, “A Statistical Model For Urban Radio Propagation”, IEEE Trans. Commun., Vol. 25, No. 7, pp. 673–680, 1977.

    Google Scholar 

  10. Corazza and F. Vatalaro, “A Statistical Model for Land Mobile Satellite Channels and Its Application to Nongeostationary Orbit Systems”, IEEE Trans. Veh. Technol., Vol. 43, pp. 738–741, 1994.

    Google Scholar 

  11. J. Modestino and S.Y. Mui, “Convolutional Code Performance in the Rician Fading Channel”, IEEE Trans. Commun., Vol. 24, No. 6, pp. 592–606, 1976.

    Google Scholar 

  12. J. Belzile, F. Gagnon and D. Haccoun, “Analysis and Performance of Bidirectional Decoding of Con-volutional Codes over Fading Channels”, IEEE Trans. Commun., Vol. 46, No. 10, pp. 1292–1300, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babalis, P., Trakadas, P. & Capsalis, C. A Maximum Likelihood Decoding Algorithm for Wireless Channels. Wireless Personal Communications 23, 283–295 (2002). https://doi.org/10.1023/A:1021155124503

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021155124503

Navigation