Skip to main content
SpringerLink
Log in

Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

Generalized minimum distance (GMD) decoding of Reed–Solomon (RS) codes can correct more errors than conventional hard-decision decoding by running error-and-erasure decoding multiple times for different erasure patterns. The latency of the GMD decoding can be reduced by the Kötter’s one-pass decoding scheme. This scheme first carries out an error-only hard-decision decoding. Then all pairs of error-erasure locators and evaluators are derived iteratively in one run based on the result of the error-only decoding. In this paper, a more efficient interpolation-based one-pass GMD decoding scheme is studied. Applying the re-encoding and coordinate transformation, the result of erasure-only decoding can be directly derived. Then the locator and evaluator pairs for other erasure patterns are generated iteratively by applying interpolation. A simplified polynomial selection scheme is proposed to pass only one pair of locator and evaluator to successive decoding steps and a low-complexity parallel Chien search architecture is developed to implement this selection scheme. With the proposed polynomial selection architecture, the interpolation can run at the full speed to greatly increase the throughput. After efficient architectures and effective optimizations are employed, a generalized hardware complexity analysis is provided for the proposed interpolation-based decoder. For a (255, 239) RS code, the high-speed interpolation-based one-pass GMD decoder can achieve 53% higher throughput than the Kötter’s decoder with slightly more hardware requirement. In terms of speed-over-area ratio, our design is 51% more efficient. In addition, compared to other soft-decision decoders, the high-speed interpolation-based GMD decoder can achieve better performance-complexity tradeoff.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6

Similar content being viewed by others

References

  1. Berlekamp, E. R. (1968). Algebraic coding theory. New York: McGraw-Hill.

    MATH  Google Scholar 

  2. Kötter, R., & Vardy, A. (2003). Algebraic soft-decision decoding of Reed–Solomon codes. IEEE Transactions on Information Theory, 49(11), 2809–2825.

    Article  Google Scholar 

  3. Jiang, J., & Narayanan, K. (2008). Algebraic soft-decision decoding of Reed–Solomon codes using bit-level soft information. IEEE Transactions on Information Theory, 54(9), 3907–3928.

    Article  MathSciNet  Google Scholar 

  4. Bellorado, J., & Kavcic, A. (2006). A low-complexity method for Chase-type decoding of Reed–Solomon codes. In Proc. of IEEE international symposium on information theory (pp. 2037–2041).

  5. Forney, G. D. (1966). Generalized minimum distance decoding. IEEE Transactions on Information Theory, 12, 125–131.

    Article  MathSciNet  MATH  Google Scholar 

  6. Sorger, U. K. (1993). A new Reed–Solomon code decoding algorithm based on Newton’s interpolation. IEEE Transactions on Information Theory, 39(2), 358–365.

    Article  MathSciNet  MATH  Google Scholar 

  7. Araki, K., Takada, M., & Morii, M. (1993). The generalized syndrome polynomial and its application to the efficient decoding of Reed–Solomon codes based on GMD criterion. In Proc. of IEEE international symposium on information theory (p. 34).

  8. Kötter, R. (1996). Fast generalized minimum-distance decoding of algebraic-geometry and Reed–Solomon codes. IEEE Transactions on Information Theory, 42(3), 721–737.

    Article  MATH  Google Scholar 

  9. Xia, H., & Cruz, J. R. (2007). Reliability-based forward recursive algorithms for algebraic soft-decision decoding of Reed–Solomon codes. IEEE Transactions on Communications, 55(7), 1273–1278.

    Article  Google Scholar 

  10. Gross, W. J., Kschischang, F. R., Kötter, R., & Gulak, P. (2002). A VLSI architecture for interpolation in soft-decision decoding of Reed–Solomon codes. In Proc. of IEEE workshop on signal processing systems (pp. 39–44).

  11. Kötter, R., & Vardy, A. (2003). A complexity reducing transformation in algebraic list decoding of Reed–Solomon codes. In Proc. of IEEE information theory workshop (pp. 10–13).

  12. Zhu, J., & Zhang, X. (2010). Efficient generalized minimum-distance decoder of Reed–Solomon codes. In Proc. of IEEE international conference on acoustics, speech, and signal processing (pp. 1502–1505).

  13. Kötter, R. (1996). On algebraic decoding of algebraic-geometric and cyclic codes. Ph.D. dissertation, Dept. of Elec. Engr., Linkoping University, Linkoping, Sweden.

  14. Nielson, R. R. (2001). List decoder of linear block codes. Ph.D. dissertation, Technical University of Denmark.

  15. Zhu, J., & Zhang, X. (2009). Factorization-free low-complexity Chase soft-decision decoding of Reed–Solomon codes. In Proc. of IEEE international symposium on circuits and systems (pp. 2677–2680).

  16. Chen, Y., & Parhi, K. K. (2004). Area efficient parallel decoder architecture for long BCH codes. In Proc. of IEEE international conference on acoustics, speech, and signal processing (pp. 73–76).

  17. Zhu, J., Zhang, X., & Wang, Z. (2008). Novel interpolation architecture for low-complexity chase soft-decision decoding of Reed–Solomon codes. In Proc. of IEEE international symposium on circuits and systems (pp. 3078–3081).

  18. Ma, J., Vardy, A., & Wang, Z. (2006). Reencoder design for soft-decision decoding of an (255, 239) Reed–Solomon code. In Proc. of IEEE international symposium on circuits and systems (pp. 3550–3553).

  19. Zhu, J., & Zhang X. (2010). High-speed re-encoder design for algebraic soft-decision Reed–Solomon decoding. In Proc. of IEEE international symposium on circuits and systems (pp. 465–468).

  20. Zhang, X., & Zhu, J. (2010). Reduced-complexity multi-interpolator algebraic soft-decision Reed–Solomon decoder. In Proc. of IEEE workshop on signal processing systems.

  21. Seth, K., Viswajith K. N., Srinivasan S., & Kamakoti, V. (2006). Ultra folded high-speed architectures for Reed–Solomon decoders. In Proc. of the 19th international conference on VLSI design (pp. 517–520).

  22. Zhang, X., & Zhu, J. (2009). Interpolation-based hard-decision Reed–Solomon decoders. In Proc. of 12th international symposium on integrated circuits (pp. 175–178).

  23. Baek, J., & Sunwoo, M. H. (2007). Simplified degree computationless modified Euclid’s algorithm and its architecture. In Proc. of IEEE international symposium on circuits and systems (pp. 905–908).

  24. Zhang, X., & Zhu, J. (2010). Algebraic soft-decision decoder architectures for long Reed–Solomon codes. IEEE Transactions on Circuits and Systems II, Express Briefs, 57(10), 787–792.

    Article  Google Scholar 

  25. Zhu, J., Zhang, X., & Wang, Z. (2008). Combined interpolation architecture for soft-decision decoding of Reed–Solomon codes. In Proc. IEEE intl. conf. computer design (pp. 526–531).

Download references

Author information

Authors and Affiliations

  1. Case Western Reserve University, Cleveland, OH, USA

    Jiangli Zhu & Xinmiao Zhang

Authors
  1. Jiangli Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinmiao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiangli Zhu.

Additional information

This work is supported by AFOSR under grant FA9550-09-1-0289.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, J., Zhang, X. Efficient Generalized Minimum-distance Decoders of Reed-Solomon Codes. J Sign Process Syst 66, 245–257 (2012). https://doi.org/10.1007/s11265-011-0600-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-011-0600-3

Keywords

Search

Navigation