RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Online Publication Date2016-12-24
Print Publication Date2016-09
Permanent link to this recordhttp://hdl.handle.net/10754/622592
MetadataShow full item record
AbstractIn 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.
CitationLin 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.
Journal2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)