Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols | IEEE Journals & Magazine | IEEE Xplore

Fast Encoding Algorithms for Reed–Solomon Codes With Between Four and Seven Parity Symbols


Abstract:

This article describes a fast Reed-Solomon encoding algorithm with four and seven parity symbols in between. First, we show that the syndrome of Reed-Solomon codes can be...Show More

Abstract:

This article describes a fast Reed-Solomon encoding algorithm with four and seven parity symbols in between. First, we show that the syndrome of Reed-Solomon codes can be computed via the Reed-Muller transform. Based on this result, the fast encoding algorithm is then derived. Analysis shows that the proposed approach asymptotically requires 3 XORs per data bit, representing an improvement over previous algorithms. The simulation demonstrates that the performance of the proposed approach improves with the increase of code length and is superior to other methods. In particular, when the parity number is 5, the proposed approach is about two times faster than other cutting-edge methods.
Published in: IEEE Transactions on Computers ( Volume: 69, Issue: 5, 01 May 2020)
Page(s): 699 - 705
Date of Publication: 03 January 2020

ISSN Information:

Funding Agency:


References

References is not available for this document.