Skip to main content
SpringerLink
Log in

Modified Low-Complexity Chase Soft-Decision Decoder of Reed–Solomon Codes

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

Abstract

Reed–Solomon (RS) codes are widely used as error-correcting codes in digital communication and storage systems. Algebraic soft-decision decoding (ASD) of RS codes can achieve substantial coding gain with polynomial complexity. Among practical ASD algorithms, the low-complexity chase (LCC) algorithm that tests 2η vectors can achieve similar or higher coding gain with lower complexity. For applications such as magnetic recording, the performance of the LCC decoding is degraded by the inter-symbol interference from the channel. Improving the performance of the LCC decoding requires larger η, which leads to higher complexity. In this paper, a modified LCC (MLCC) decoding is proposed by adding erasures to the test vectors. With the same η, the proposed algorithm can achieve much better performance than the original LCC decoding. One major step of the LCC and MLCC decoding is the interpolation. To reduce the complexity of the interpolation, this paper also proposed a prioritized interpolation scheme to test a small proportion of the vectors at a time, starting with the ones with higher reliabilities. For a (458, 410) RS code, by testing 1/8 of the vectors at a time, the area requirement of the MLCC decoder with η = 8 can be reduced to 57%, and the average decoding latency is reduced to 73%.

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

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

  2. 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 

  3. 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).

  4. Guruswami, V., & Sudan, M. (1999). Improved decoding of Reed–Solomon and algebraic–geometric codes. IEEE Transactions on Information Theory, 45(6), 1755–1764.

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  6. Xia, H., Wang, H., & Cruz, J. (2008). A Chase-GMD algorithm for soft-decision decoding of Reed–Solomon codes on perpendicular recording channels. In Proc. of IEEE international conference on communications (pp. 1977–1981).

  7. Lee, S., & Kumar, B. (2008). Soft-decision decoding of Reed–Solomon codes using successive error-and-erasure decoding. In Proc. of IEEE global telecommunications conference (pp. 1–5).

  8. Gross, W. J., Kschischang, F. R., Koetter, 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).

  9. Koetter, 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).

  10. Ahmed, A., Koetter, R., & Shanbhag, N. (2004). VLSI architecture for soft-decision decoding of Reed–Solomon codes. In Proc. of IEEE international conference on communications (pp. 2584–2590).

  11. Wang, Z., & Ma, J. (2006). High-speed interpolation architecture for soft-decision decoding of Reed–Solomon codes. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 14(9), 937–950.

    Article  Google Scholar 

  12. Zhang, X. (2006). Reduced complexity interpolation architecture for soft-decision Reed–Solomon decoding. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 14(10), 1156–1161.

    Article  Google Scholar 

  13. Zhang, X., & Zhu, J. (2008). Efficient interpolation architecture for soft-decision Reed–Solomon decoding by applying slow-down. In Proc. of IEEE workshop on signal processing systems (pp. 19–24).

  14. Zhang, X., & Parhi, K. K. (2005). Fast factorization architecture in soft-decision Reed–Solomon decoding. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 13(4), 413–426.

    Article  Google Scholar 

  15. Zhang, X. (2007). Further exploring the strength of prediction in the factorization of soft-decision Reed–Solomon decoding. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 15(7), 811–820.

    Article  Google Scholar 

  16. Ma, J., Vardy, A., & Wang, Z. (2007). Low-latency factorization architecture for algebraic soft-decision decoding of Reed–Solomon codes. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 15(11), 1225–1238.

    Article  Google Scholar 

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

  18. 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).

  19. Zhu, J., Zhang, X., & Wang, Z. (2009). Backward interpolation architecture for algebraic soft-decision Reed–Solomon decoding. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 17(11), 1602–1615.

    Article  Google Scholar 

  20. Zhang, X., & Zhu, J. (2010). Algebraic soft-decision decoder architectures for long Reed–Solomon codes. IEEE Transactions on Circuits and Systems II, in press.

  21. Koetter, R. (1996). On algebraic decoding of algebraic–geometric and cyclic codes. Ph.D. dissertation, Dept. of Elec. Engr., Linkoping University, Linkoping, Sweden.

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

  23. McEliece, R. J. (2003). The Guruswami–Sudan decoding algorithm for Reed–Solomon codes. In IPN progress report (pp. 42–53).

  24. 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.

  25. 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).

  26. Zhang, X., & Zhu, J. (2010). Hardware complexities of algebraic soft-decision Reed–Solomon decoders and comparisons. In Proc. of information theory and applications workshop.

  27. 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).

Download references

Author information

Authors and Affiliations

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

    Xinmiao Zhang & Jiangli Zhu

  2. Tianjin University, Tianjin, China

    Wei Zhang

Authors
  1. Xinmiao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiangli Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wei Zhang.

Additional information

This work is supported in part by the NSF under grants ECCS-0802159 and 0846331.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, X., Zhu, J. & Zhang, W. Modified Low-Complexity Chase Soft-Decision Decoder of Reed–Solomon Codes. J Sign Process Syst 66, 3–13 (2012). https://doi.org/10.1007/s11265-010-0522-5

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-010-0522-5

Keywords

Search

Navigation