RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities
Type
Conference PaperKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionElectrical Engineering Program
Date
2016-12-24Online Publication Date
2016-12-24Print Publication Date
2016-09Permanent link to this record
http://hdl.handle.net/10754/622592
Metadata
Show full item recordAbstract
In computer storage, RAID 6 is a level of RAID that can tolerate two failed drives. When RAID-6 is implemented by Reed-Solomon (RS) codes, the penalty of the writing performance is on the field multiplications in the second parity. In this paper, we present a configuration of the factors of the second-parity formula, such that the arithmetic complexity can reach the optimal complexity bound when the code length approaches infinity. In the proposed approach, the intermediate data used for the first parity is also utilized to calculate the second parity. To the best of our knowledge, this is the first approach supporting the RAID-6 RS codes to approach the optimal arithmetic complexity.Citation
Lin S-J, Alloum A, Al-Naffouri TY (2016) RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities. 2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). Available: http://dx.doi.org/10.1109/PIMRC.2016.7794681.Additional Links
http://ieeexplore.ieee.org/document/7794681/ae974a485f413a2113503eed53cd6c53
10.1109/PIMRC.2016.7794681