Accelerated processing for maximum distance separable codes using composite extension fields

Diego Ruano, Daniel E. Lucani, Olav Geil

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationEuropean Wireless 2019 Conference, EW 2019
Number of pages5
PublisherVDE Verlag GMBH
Publication date1 Jan 2019
Pages14-18
ISBN (Electronic)9783800749492
Publication statusPublished - 1 Jan 2019
Event25th European Wireless Conference 2019: Wireless Futures in the Era of Network Programmability, EW 2019 - Aarhus, Denmark
Duration: 2 May 20194 May 2019

Conference

Conference25th European Wireless Conference 2019: Wireless Futures in the Era of Network Programmability, EW 2019
CountryDenmark
CityAarhus
Period02/05/201904/05/2019
SponsorAarhus University, INCOM

Fingerprint Dive into the research topics of 'Accelerated processing for maximum distance separable codes using composite extension fields'. Together they form a unique fingerprint.

Cite this