Abstract
Reed-Solomon (RS) codes play an important role in providing error protection and data integrity. Among various Reed-Solomon decoding algorithms, the Peterson-Gorenstein-Zierler (PGZ) algorithm in general has the least computational complexity for small t values. However, unlike the iterative approaches (e.g., Berlekamp-Massey and Euclidean algorithms), it will encounter divided-by-zero problems in solving multiple t values. In this paper, we propose a multi-mode hardware architecture for error numbers ranging from zero to three. We first propose a cost-down technique to reduce the hardware complexity of a t = 3 decoder. A Finite-field Inversion (FFI) elimination scheme is also proposed in our PGZ kernel. Next, we perform an algorithmic-level derivation to identify the configurable feature of our design. With those manipulations, we are able to perform multi-mode RS decoding in one unified VLSI architecture with very simple control scheme. The very low cost and simple data-path make our design a good choice in small-footprint embedded VLSI systems such as Error Control Coding (ECC) in memory/storage systems.
Similar content being viewed by others
References
S.B. Wicker, Error Control Systems for Digital Communication and Storage, Prentice Hall, 1995.
Wicker and Bhargava, Reed-Solomon Codes and Applications, IEEE Press, 1994.
S. Whitaker, J. Canaris, and K. Cameron, “Reed-Solomon VLSI codec for advanced television,” IEEE Trans. Circuits Syst. Video Technol., vol. 1, 1991, pp. 230-236.
A. Raghupathy and K.J.R. Liu, “Algorithm-Based Low-Power/High-Speed Reed Solomon Decoder Design,” IEEE Trans. on Circuits and Systems II, vol. 47, Issue: 11, 2000, pp. 1254-1270.
M. Srinivasan and D.V. Sarwate, “Malfunction in the Peterson-Gorenstein-Zierler Decoder,” IEEE Trans. on Information Theory, vol. 40, no. 5, 1994, pp. 1649-1653.
Son Le-Ngoc and Z. Young, “An Approach to Double Error Correcting Reed-Solomon Decoding without Chien Search,” in Proceedings of the 36th Midwest Symposium, vol. 1, 1993, pp. 534-537.
K.Y. Liu, “Architecture for VLSI Design of Reed-Solomon Decoders,” IEEE Trans. on Computers, vol. C-33, no. 2, 1984.
L. Song and K.K. Parhi, “Low-Energy Software Reed-Solomon Codec using Specialized Finite Field Datapath and Division-Free Berlekamp-Massey Algorithm,” in Proc. IEEE International Symposium on Circuits and Systems, vol. 1, 1999, pp. 84-89.
H.M. Shao, T.K. Truong, L.J. Deutsch, J.H. Yuen, and I.S. Reed, “A VLSI Design of a Pipeline Reed-Solomon Decoder,” IEEE Trans. on Computers, vol. C-34, no. 5, 1985.
Po Tong, “A 40-MHz Encoder-Decoder Chip Generated by a Reed-Solomon Code Compiler,” Custom Integrated Circuits Conference, 1990, pp. 13.5/1-13.5/4.
S. Kwon and H. Shin, “An Area-efficient VLSI Architecture of a Reed-Solomon Decoder/Encoder for Digital VCRS,” IEEE Trans on Cnsumer Electronics, vol. 43, no. 4, 1997.
W. Peterson, “Encoding and Error Correstion Procedures for the Bose-Chaudhuri Codes,” IRE Trans. Inform. Theory, vol. IT-6, 1960, pp. 459-470.
D. Gorenstein and N. Zierler, “AClass of Error-Correcting Codes in pm Symbols,” J. Soc. Ind. Appl. Math., no. 9, 1961, pp. 207-214.
W. Peterson, Error Correcting Codes. 1st edn., Cambridge, MA: MIT Press, 1961.
L. Hanzo, P.J. Cherriman, and J. Streit, Wireless Video Communications: Second to Third Generation Systems and Beyond, IEEE Press, 2001.
G. Forney Jr, “On Decoding BCH Codes,” IEEE Transactions on Information Theory, vol. IT-11, 1965, pp. 549-557.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hsu, HY., Wang, SF. & Wu, AY.(. A Novel Low-Cost Multi-Mode Reed Solomon Decoder Design Based on Peterson-Gorenstein-Zierler Algorithm. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 34, 251–259 (2003). https://doi.org/10.1023/A:1023200419497
Published:
Issue Date:
DOI: https://doi.org/10.1023/A:1023200419497