Skip to main content

Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes

  • Conference paper
  • First Online:
Book cover Cryptography and Coding (Cryptography and Coding 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1746))

Included in the following conference series:

Abstract

In this paper we introduce three soft-decision decoding algorithms for Reed-Solomon (RS) codes. We compare them in terms of performance over both the AWGN and Rayleigh Fading Channels and in terms of complexity with a special emphasis on RS codes over IF16. The algorithms discussed are variants of well known algorithms for binary codes adapted to the multilevel nature of RS codes. All involve a re-ordering of the received symbols according to some reliability measure. The choice of reliability measure for our simulations is based on a comparison of three in terms of how they affect the codes’ performances.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wesemeyer S. and Sweeney P.: Suboptimal soft-decision decoding for some RS-codes. IEE Electronics Letters 34(10) (1998) 983–984

    Article  Google Scholar 

  2. Dorsch B.G.: A decoding algorithm for binary block codes and J-ary output channels. IEEE Trans. Inform. Theory IT-20(3) (1974) 391–394

    Article  Google Scholar 

  3. Fossorier M.P.C. and Lin S.: Soft-decision decoding of linear block codes based on ordered statistics. IEEE Trans. Inform. Theory 41(5) (1995) 1379–1396

    Article  Google Scholar 

  4. Taipale D.J. and Pursley M.B.: An improvement to generalized-minimum-distance decoding. IEEE Trans. Inform. Theory 37(1) (1991) 167–172

    Article  MathSciNet  Google Scholar 

  5. Fossorier M.P.C. and Lin S.: Complementary reliability-based decodings of binary linear block codes. IEEE Trans. Inform. Theory 43(5) (1997) 1667–1672

    Article  MathSciNet  Google Scholar 

  6. Stichtenoth, H.: Algebraic function fields and codes. Springer-Verlag, 1993

    Google Scholar 

  7. ForneyJr, G.D.: Generalized minimum distance decoding. IEEE Trans. Inform. Theory IT-12 (1966) 125–131

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wesemeyer⋆, S., Sweeney, P., Burgess, D.R.B. (1999). Some Soft-Decision Decoding Algorithms for Reed-Solomon Codes. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66887-9

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics