Abstract
This paper presents a novel area-efficient key equation solver (KES) architecture for the syndrome-based Reed-Solomon (RS) decoders. We develop the compensated simplified reformulated inversionless Berlekamp-Massey (CS-RiBM) algorithm, which is proved to successfully remove unnecessary computations in the conventional reformulated inversionless Berlekamp-Massey (RiBM) algorithm with simple compensation. The proposed algorithm results in a simplified KES architecture using much fewer processing elements and can be implemented by a homogenous systolic architecture. The RS (255, 239) and RS (255, 223) decoders using the CS-RiBM architecture have been designed and synthesized with SMIC 0.18 μm CMOS technology library. The synthesis results, excluding FIFO stacks, show that the CS-RiBM architecture can reduce 14 to 29 % area compared with the prior related architectures based on the Berlekamp-Massey (BM) and modified Euclidean (ME) algorithms. The proposed RS decoders achieve similarly high throughput to the RS decoders using the RiBM architecture with lower hardware complexity and are 17 to 22 % more efficient. Higher efficiency is achievable as the error-correcting capability of the RS code increases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blahut, R.E. (1983). Theory and Practice of Error-Control Codes. Reading: Addison-Wesley.
Berlekamp, E.R. (1968). Algebraic Coding Theory. New York: McGraw-Hill.
Shao, H.M., Truong, T.K., Deutsch, L.J., Yuen, J.H., & Reed, I.S (1985). A VLSI design of a pipeline Reed-Solomon decoder. IEEE Transactions on Computers, C-34(5), 393–403.
Baek, J.H., & Sunwoo, M.H (2006). New degree computationless modified Euclid’s algorithm and architecture for Reed-Solomon decoder. IEEE Transactions on Very Large Scale Integration Systems, 14(8), 915–920.
Baek, J.H., & Sunwoo, M.H (2007). Enhanced degree computationless modified Euclid’s algorithm for Reed-Solomon decoders. IEEE Electronics Letters, 43(3), 175–176.
Baek, J.H., & Sunwoo, M.H (2013). New Cost-Effective simplified Euclid’s algorithm for Reed-Solomon decoders. Springer Journal of Signal Processing Systems, 71(2), 159–168.
Reed, L.S., & Shih, M.T. (1991). VLSI design of inverse-free Berlekamp-Massey algorithm (Vol. 138, pp. 295–298).
Sarwate, D.V., & Shanbhag, N.R (2001). High-speed architecture for Reed-Solomon decoders. IEEE Transactions on Very Large Scale Integration Systems, 9(5), 641–655.
Park, J.I., & Lee, H (2011). Area-efficient truncated Berlekamp-Massey architecture for Reed-Solomon decoder. IEEE Electronics Letters, 47(4), 241–243.
Chen, C.L (1981). High-speed decoding of BCH codes. IEEE Transactions on Information Theory, 27(2), 254–256.
Acknowledgments
The authors would like to thank the National Natural Science Foundation of China (Grant No. 61474080) and the Program for New Century Excellent Talents in University of China for supporting this work.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liang, Z., Zhang, W. Efficient Berlekamp-Massey Algorithm and Architecture for Reed-Solomon Decoder. J Sign Process Syst 86, 51–65 (2017). https://doi.org/10.1007/s11265-015-1094-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11265-015-1094-1