Fast Decoding Algorithms for Reed-Solomon Codes
- 78 Downloads
Reed-Solomon codes and BCH codes of large blocklength and large alphabet size are coming into widespread use in communication and storage systems. Secure communication systems commonly use a Reed-Solomon code as one method of jam protection. The importance of these codes is partly due to their superior error-correcting performance, but it is equally due to the availability of efficient decoding algorithms for them. Future requirements will exist for ever-larger error-control codes, but only if the decoding cost remains affordable. It is important to reduce the complexity of the decoding algorithms. These lectures explore the complexity of such algorithms.
KeywordsInverse Fourier Transform Chinese Remainder Theorem Solomon Code Convolution Algorithm Receive Word
Unable to display preview. Download preview PDF.
- 3.Thomas, L.H., “Using a Computer to Solve Problems in Physics,” in Applications of Digital Computers, Boston, Mass., Ginn and Co., 1963.Google Scholar
- 4.Justesen, J., “On the Complexity of Decoding Reed-Solomon Codes,: IEEE Trans. on Information Theory, Vol. IT-22, pp. 237–238, 1976.Google Scholar
- 5.Sarwate, D.V., “On the Compexity of Decoding Goppa Codes,” IEEE Trans. on Information Theory Vol. IT-23, pp. 515–516, 1977.Google Scholar
- 6.Agarwal, R., and J.W. Cooley, “Algorithms for Digital Convolution,” IEEE Trans. on Acoustics, Speech and Signal Processing, Vol. ASSP-25, pp. 392–410, 1977.Google Scholar
- 8.Nussbaumer, H.J. Fast Fourier Transform and Convolution Algorithms Springer Verlag, Berlin, 1981.Google Scholar
- 9.Miller, R.L., T.K. Truong, and I.S. Reed, “Efficieng Program for Decoding the (255, 223) Reed-Solomon Code Over GF(2) with Both Errors and Erasures, Using Transform Decoding,” IEEE Proceedings, Volume 127, pp. 136–142, 1980.Google Scholar
- 10.Blahut, R.E., “Efficient Decoder Algorithms Based on Spectral Techniques,” IEEE Abstracts of Papers - IEEE International Symposium on Information Theory, Santa Monica, California, 1981.Google Scholar