Reed–Solomon (RS) codes possess excellent error correction capability. Algebraic soft-decision decoding (ASD) of RS codes can provide better correction performance than the hard-decision decoding (HDD). The low-complexity Chase (LCC) decoding has the lowest complexity cost and similar or even higher coding gain among all of the available ASD algorithms. Instead of employing complicated interpolation technique, the LCC decoding can be implemented based on the HDD. This study proposes a modified serial LCC decoder, which employs a novel syndrome calculation, polynomial selection, Chien search and Forney algorithm block. In addition, an improved two-dimensional optimisation is provided to reduce the hardware complexity of the proposed decoder. Compared with the previous design, the proposed decoder can improve about 1.27 times speed and obtain 1.29 times higher efficiency in terms of throughput-over-slice ratio.

References

1. 1)
  - 17. Zhang, W., Wang, J., Wang, H., et al: ‘Low-power high-efficiency architecture for low-complexity chase soft-decision Reed-Solomon decoding’, IET Communications, 2012, 6, (17), pp. 3046–3052 (doi: 10.1049/iet-com.2012.0170).
2. 2)
  - 20. Chen, Y., Parhi, K.K.: ‘Area efficient parallel decoder architecture for long BCH codes’. Proc. IEEE Int. Conf. Acoust., Speech, Signal Process., Quebec, Canada, May 2004, pp. 73–76.
3. 3)
  - 11. Zhang, X., Wu, Y., Zhu, J., et al: ‘Novel interpolation and polynomial selection for low-complexity chase soft-decision Reed-Solomon decoding’, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2012, 20, (7), pp. 1318–1322 (doi: 10.1109/TVLSI.2011.2150254).
4. 4)
  - 3. Bellorado, J., Kavčić, A.: ‘A low-complexity method for chase-type decoding of Reed-Solomon codes’. Proc. IEEE Int. Symp. on Inf. Theory, Seattle, USA, July 2006, pp. 2037–2041.
5. 5)
  - 24. Lee, Y., Yoo, H., Park, I.: ‘Low-complexity parallel Chien search structure using two-dimensional optimisation’, IEEE Trans. Circuits Syst. II, Exp. Briefs, 2011, 58, (8), pp. 522–526 (doi: 10.1109/TCSII.2011.2158709).
6. 6)
  - 22. Paar, C.: ‘Optimised arithmetic for Reed-Solomon encoders’. Proc. IEEE Int. Symp. Inf. Theory, Ulm, Germany, July 1997, pp. 250–250.
7. 7)
  - 10. Zhang, X., Zheng, Y.: ‘Generalised backward interpolation for algebraic soft-decision decoding of Reed-Solomon codes’, IEEE Trans. Commun., 2013, 61, (1), pp. 13–23 (doi: 10.1109/TCOMM.2012.100912.110834).
8. 8)
  - 6. Chen, L., Carrasco, R.A., Chester, E.G.: ‘Performance of Reed-Solomon codes using the Guruswami-Sudan algorithm with improved interpolation efficiency’, IET Commun., 2007, 1, (2), pp. 241–250 (doi: 10.1049/iet-com:20060057).
9. 9)
  - M. Potkonjak , M.B. Srivastava , A.P. Chandrakasan . Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. , 2 , 151 - 165
10. 10)
  - 9. Zhang, X., Zhu, J.: ‘Reduced-complexity multi-interpolator algebraic soft-decision Reed-Solomon decoder’. Proc. IEEE Workshop SiPS, October 2010, pp. 398–403.
11. 11)
  - W.J. Gross , F.R. Kschischang , R. Kötter , P.G. Gulak . Towards a VLSI architecture for interpolation-based soft-decision Reed-Solomon decoders. J. VLSI Signal Process. , 93 - 111
12. 12)
  - R. Koetter , A. Vardy . Algebraic soft-decision decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory , 2809 - 2825
13. 13)
  - X.M. Zhang , J.L. Zhu . Algebraic soft-decision decoder architectures for long Reed–Solomon codes. IEEE Trans. Circuits Syst., II , 10 , 787 - 792
14. 14)
  - 14. Zhang, W., Wang, H., Pan, B.: ‘Reduced-complexity LCC Reed-Solomon decoder based on unified syndrome computation’, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2013, 21, (5), pp. 974–978 (doi: 10.1109/TVLSI.2012.2197030).
15. 15)
  - 16. Zhang, X., Zhu, J., Zhang, W.: ‘Efficient reencoder architecture for algebraic soft-decision Reed-Solomon decoding’, IEEE Trans. Circuits Syst. II, Exp. Briefs, 2012, 59, (3), pp. 163–167 (doi: 10.1109/TCSII.2012.2184376).
16. 16)
  - J.L. Zhu , X.M. Zhang , Z. Wang . Backward interpolation architecture for algebraic soft-decision Reed–Solomon decoding. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. , 11 , 1602 - 1615
17. 17)
  - 19. Lee, H.: ‘A high-speed low-complexity Reed-Solomon decoder for optical communications’, IEEE Trans. Circuits Syst. II, Exp. Briefs, 2005, 52, (8), pp. 461–465 (doi: 10.1109/TCSII.2005.850452).
18. 18)
  - 12. García-Herrero, F., Canet, M.J., Valls, J., et al: ‘High-throughput interpolator architecture for low-complexity Chase decoding of RS codes’, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2012, 20, (3), pp. 568–573 (doi: 10.1109/TVLSI.2010.2103961).
19. 19)
  - 5. Zhu, J., Zhang, X., Wang, Z.: ‘Novel interpolation architecture for low-complexity chase soft-decision decoding of Reed-Solomon codes’. Proc. IEEE Int. Symp. Circuits Syst., Seattle, USA, May 2008, pp. 3078–3081.
20. 20)
  - J. Jiang , K. Narayanan . Algebraic soft-decision decoding of Reed-Solomon codes using bit-level soft information. IEEE Trans. Inf. Theory , 9 , 3907 - 3928
21. 21)
  - F. García-Herrero , J. Valls , P.K. Meher . High-speed RS (255, 239) decoder based on LCC decoding. Circuits Syst. Signal Process. , 6 , 1643 - 1669
22. 22)
  - 18. Zhang, X., Zheng, Y.: ‘Systematically re-encoded algebraic soft-decision Reed-Solomon decoder’, IEEE Trans. Circuits Syst. II, Exp. Briefs, 2012, 59, (6), pp. 376–380 (doi: 10.1109/TCSII.2012.2195066).
23. 23)
  - 15. Zhu, J., Zhang, X.: ‘High-speed re-encoder design for algebraic soft-decision of Reed-Solomon codes’. Proc. IEEE Int. Symp. Circuits Syst., Paris, France, May 2010, pp. 465–468.
24. 24)
  - 23. Hu, Q., Wang, Z., Zhang, J., Xiao, J.: ‘Low complexity parallel Chien search architecture for RS decoder’. Proc. IEEE Int. Symp. Circuits Syst., Kobe, Japan, May 2005, pp. 340–343.

Efficient architecture for algebraic soft-decision decoding of Reed–Solomon codes

References

Related content