A High-Speed Parallel Decoding Algorithm for Erasure Codes in the Distributed Storage System

A high-speed parallel decoding algorithm for erasure codes in the distributed storage system is proposed in this paper. Although erasure codes can tolerate multiple failures, single failures represent 99.75% of recoveries. So the decoding is optimized in only 1 failure first and then complex odd and...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2021 2nd Information Communication Technologies Conference (ICTC) s. 283 - 287
Hlavní autori: Wu, Ruizhen, Wu, Yan, Wang, Mingming, Wang, Lin
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 07.05.2021
Predmet:
Cauchy matrix
Communications technology
Decoding
erasure code
gaussian elimination
Hardware design languages
LU factorization Elimination
Vandermonde matrix
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A high-speed parallel decoding algorithm for erasure codes in the distributed storage system is proposed in this paper. Although erasure codes can tolerate multiple failures, single failures represent 99.75% of recoveries. So the decoding is optimized in only 1 failure first and then complex odd and even failure number situations to work with the same module but different parameters and operation flow. The algorithm is implemented in Verilog and synthesized with GF 12nm technology lib. In comparison to Gaussian elimination, LU factorization Elimination the proposed algorithm can have 55.7% to 67% speed reduction clearly have advantages.
DOI:10.1109/ICTC51749.2021.9441660