Accelerated processing for maximum distance separable codes using composite extension fields

Diego Ruano, Daniel E. Lucani, Olav Geil

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

Abstrakt

This paper describes a new design of Reed-Solomon (RS) codes when using composite extension fields. Our ultimate goal is to provide codes that remain Maximum Distance Separable (MDS), but that can be processed at higher speeds in the encoder and decoder. This is possible by using coefficients in the generator matrix that belong to smaller (and faster) finite fields of the composite extension and limiting the use of the larger (and slower) finite fields to a minimum. We provide formulae and an algorithm to generate such constructions starting from a Vandermonde RS generator matrix and show that even the simplest constructions, e.g., using only processing in two finite fields, can speed up processing by as much as two-fold compared to a Vandermonde RS and Cauchy RS while using the same decoding algorithm, and more than two-fold compared to other RS Cauchy and FFT-based RS.
OriginalsprogEngelsk
TitelEuropean Wireless 2019 Conference, EW 2019
Antal sider5
ForlagVDE Verlag GMBH
Publikationsdato1 jan. 2019
Sider14-18
ISBN (Elektronisk)9783800749492
StatusUdgivet - 1 jan. 2019
Begivenhed25th European Wireless Conference 2019: Wireless Futures in the Era of Network Programmability, EW 2019 - Aarhus, Danmark
Varighed: 2 maj 20194 maj 2019

Konference

Konference25th European Wireless Conference 2019: Wireless Futures in the Era of Network Programmability, EW 2019
LandDanmark
ByAarhus
Periode02/05/201904/05/2019
SponsorAarhus University, INCOM

Fingeraftryk Dyk ned i forskningsemnerne om 'Accelerated processing for maximum distance separable codes using composite extension fields'. Sammen danner de et unikt fingeraftryk.

Citationsformater