Abstract
Fast algorithms are proposed for encoding and reconstructing data in RAID based on Reed-Solomon codes. The proposed approach is based on the cyclotomic fast Fourier transform algorithm and enables one to significantly reduce the number of expensive Galois field multiplications required. The complexity of the obtained algorithms is much lower than those for existing MDS array codes. Software implementation of the proposed algorithms is discussed. The performance results show that the new algorithms provide substantially better performance compared with the standard algorithm.
- A. Al Ghouwayel, Y. Louet, A. Nafkha, and J. Palicot. 2007. On the FPGA implementation of the Fourier transform over finite fields GF(2m). In Proceedings of the International Symposium on Communications and Information Technologies (ISCIT’07). 146--151.Google Scholar
- S. Bellini, M. Ferrari, and A. Tomasoni. 2011. On the structure of cyclotomic Fourier transforms and their applications to Reed-Solomon codes. IEEE Transactions on Communications 59, 8, 2110--2118.Google Scholar
Cross Ref
- R. Bhaskar, P. Dubey, V. Kumar, A. Rudra, and A. Sharma. 2003. Efficient Galois field arithmetic on SIMD architectures. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures. 256--257. Google Scholar
Digital Library
- R. Blahut. 1984. Theory and Practice of Error Control Codes. Addison-Wesley.Google Scholar
- M. Blaum, J. Brady, J. Bruck, and J. Menon. 1995. EVENODD: An optimal scheme for tolerating double disk failures in RAID architectures. IEEE Transactions on Computers 44, 2. Google Scholar
Digital Library
- J. Blomer, M. Kalfanej, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman. 1995. An XOR-Based Erasure-Resilient Coding Scheme. Tech. Rep., International Computer Science Institute, Berkeley, California.Google Scholar
- N. Chen and Z. Yan. 2009a. Cyclotomic FFTs with reduced additive complexities based on a novel common subexpression elimination algorithm. IEEE Transactions on Signal Processing 57, 3, 1010--1020. Google Scholar
Digital Library
- N. Chen and Z. Yan. 2009b. Reduced-complexity Reed-Solomon decoders based on cyclotomic FFTs. IEEE Signal Processing Letters 16, 4, 279--282.Google Scholar
Cross Ref
- E. Chu and A. George. 2000. Inside the FFT Black Box: Serial and Parallel Fast Fourier Transform Algorithms. CRC Press.Google Scholar
- P. Corbett, B. English, A. Goel, T. Grcanac, S. Kleiman, J. Leong, and S. Sankar. 2004. Row-diagonal parity for double disk failure correction. In Proceedings of the 3rd USENIX Conference on File and Storage Technologies. USENIX Association, Berkeley, CA, 1--14. Google Scholar
Digital Library
- E. Costa, S. V. Fedorenko, and P. V. Trifonov. 2004. On computing the syndrome polynomial in Reed-Solomon decoder. European Transactions on Telecommunications 15, 4, 337--342.Google Scholar
Cross Ref
- F. Didier. 2009. Efficient erasure decoding of reed-solomon codes. arXiv:1301.5536v1.Google Scholar
- S. Fedorenko. 2006. A method for computation of the discrete Fourier transform over a finite field. Problems of Information Transmission 42, 2, 139--151. Google Scholar
Digital Library
- S. Fedorenko. 2011a. The discrete Fourier transform over a finite field with reduced multiplicative complexity. In Proceedings of IEEE International Symposium on Information Theory. 1200--1204.Google Scholar
Cross Ref
- S. V. Fedorenko. 2011b. A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree. IEEE Transactions on Information Theory. Available at http://arxiv.org/abs/1112.1639.Google Scholar
- P.-H. Hsieh, I.-Y. Chen, Y.-T. Lin, and S.-Y. Kuo. 2004. An XOR based Reed-Solomon algorithm for advanced RAID systems. In Proceedings of 19th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems. Google Scholar
Digital Library
- C. Huang, M. Chen, and J. Li. 2007. Pyramid codes: Flexible schemes to trade space for access efficiency in reliable data storage systems. In Proceedings of 6th IEEE International Symposium on Network Computing and Applications. 79--86.Google Scholar
- D. E. Knuth. 1973. The Art of Computer Programming. Vol. 2. Addison-Wesley.Google Scholar
- R. Lidl and H. Niederreiter. 1996. Finite Fields. Cambridge University Press.Google Scholar
- T.-C. Lin, T. Truong, and P. Chen. 2007. A fast algorithm for the syndrome calculation in algebraic decoding of Reed-Solomon codes. IEEE Transactions on Communications 55, 12, 2240--2244.Google Scholar
Cross Ref
- F. J. MacWilliams and N. J. A. Sloane. 1977. The Theory of Error-Correcting Codes. North-Holland Publishing Company.Google Scholar
- T. K. Moon. 2005. Error Correction Coding. Mathematical Methods and Algorithms. Wiley. Google Scholar
Digital Library
- J. S. Plank. 1997. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software -- Practice and Experience 27, 9, 995--1012. Google Scholar
Digital Library
- J. S. Plank. 2005a. Enumeration of Optimal and Good Cauchy Matrices for Reed-Solomon Coding. Tech. Rep. CS-05-570, University of Tennessee.Google Scholar
- J. S. Plank. 2005b. Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Storage Applications. Tech. Rep. CS-05-569, University of Tennessee.Google Scholar
- J. S. Plank and K. M. Greenan. 2014. Jerasure: A Library in C Facilitating Erasure Coding for Storage Applications -- version 2.0. Tech. Rep. UT-EECS-14-721, University of Tennessee.Google Scholar
- J. S. Plank, K. M. Greenan, and E. L. Miller. 2013. Screaming fast Galois field arithmetic using intel SIMD instructions. In Proceedings of 11th Usenix Conference on File and Storage Technologies. Google Scholar
Digital Library
- A. Soro and J. Lacan. 2010. FNT-based Reed-Solomon erasure codes. In 7th IEEE Consumer Communications and Networking Conference. Google Scholar
Digital Library
- I. Tamo, Z. Wang, and J. Bruck. 2011. MDS array codes with optimal rebuilding. In Proceedings of IEEE International Symposium on Information Theory. 1240--1244.Google Scholar
- P. Trifonov. 2007. Matrix-vector multiplication via erasure decoding. In Proceedings of the 11th International Symposium on Problems of Redundancy in Information and Control Systems.Google Scholar
- P. Trifonov. 2012. On the additive complexity of the cyclotomic FFT algorithm. In Proceedings of IEEE Information Theory Workshop.Google Scholar
Cross Ref
- P. V. Trifonov and S. V. Fedorenko. 2003. A method for fast computation of the Fourier transform over a finite field. Problems of Information Transmission 39, 3, 231--238. Translation of Problemy Peredachi Informatsii. Google Scholar
Digital Library
- X. Wu, M. Wagh, N. Chen, Y. Wang, and Z. Yan. 2011. Composite cyclotomic Fourier transforms with reduced complexities. IEEE Transactions on Signal Processing 59, 5, 2136--2145. Google Scholar
Digital Library
- X. Wu, Y. Wang, and Z. Yan. 2012. On algorithms and complexities of cyclotomic fast Fourier transforms over arbitrary finite fields. IEEE Transactions on Signal Processing 60, 3, 1149--1158. Google Scholar
Digital Library
- X. Wu and Z. Yan. 2011. Computational complexity of cyclotomic fast Fourier transforms over characteristic-2 fields. In Proceedings of the IEEE Workshop on Signal Processing Systems (SiPS’11). 1--6.Google Scholar
- L. Xu and J. Bruck. 1999. X-code: MDS array codes with optimal encoding. IEEE Transactions on Information Theory 45, 1. Google Scholar
Digital Library
Recommendations
On fast Fourier transform-based decoding of Reed-Solomon codes
Reed-Solomon (RS) codes is a popular class of codes that have been implemented in many practical systems. Recently, a fast approach to the error decoding of RS codes based on fast Fourier transform (FFT) was invented. In this work, we derive the key ...
Application of the Concatenation of Reed Solomon and Luby Transform Codes in Deep Communications
SMC-IT '09: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information TechnologyFor the problem of low code gain of the concatenation of Reed Solomon (RS) codes and convolutional codes (CC), the concatenated scheme of RS+CC and Luby Transform (LT) codes with an improved decoding algorithm is proposed. The improved decoding ...
Module minimisation based low‐complexity soft decoding of Reed–Solomon codes
The interpolation‐based algebraic decoding for Reed–Solomon (RS) codes can correct errors beyond half of the code's minimum Hamming distance. Using soft information, the algebraic soft decoding (ASD) further improves the decoding performance. This paper ...






Comments