RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities

Sian Jheng Lin, Amira Alloum, Tareq Y. Al-Naffouri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

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.
Original languageEnglish (US)
Title of host publication2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
ISBN (Print)9781509032549
DOIs
StatePublished - Dec 24 2016

Fingerprint

Dive into the research topics of 'RAID-6 reed-solomon codes with asymptotically optimal arithmetic complexities'. Together they form a unique fingerprint.

Cite this