DC FieldValueLanguage
dc.contributor.authorStanković, Radomiren
dc.contributor.authorAstola, Jaakkoen
dc.contributor.authorMoraga, Claudioen
dc.contributor.authorGajić, Dušanen
dc.date.accessioned2020-05-01T20:29:09Z-
dc.date.available2020-05-01T20:29:09Z-
dc.date.issued2014-01-01en
dc.identifier.isbn978-1-479-93534-5en
dc.identifier.issn0195-623Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2041-
dc.description.abstractGalois field (GF) expressions are analytical representations of multiple-valued functions. For practical applications it is important to provide fast algorithms for computing coefficients in these expressions. From the FFT-theory point of view, these algorithms are Cooley-Tukey type algorithms based on the Good-Thomas factorization derived from the Kronecker product structure of the GF-transform matrices. These algorithms are good for reducing the number of operations in Central Processing Unit (CPU) implementations. When implemented over Graphics Processing Units (GPUs), the address arithmetic becomes an important factor determining the efficiency of the implementations, due to the differences between the CPU and GPU based architectures and the corresponding programming philosophies. In this paper, we define the constant geometry algorithms for computing the coefficients in GF-expressions by an analogy with the corresponding algorithms in Fourier analysis on finite Abelian groups. We performed an experimental verification of the proposed algorithms compared to the Cooley-Tukey algorithms over two GPU platforms (Nvidia and AMD) and two programming environments (CUDA and OpenCL) with the corresponding CPU implementations. The speedup achieved by constant geometry algorithms increases with the number of variables and, therefore, the constant geometry algorithms are more advantageous in the case of functions with a larger number of variables.en
dc.publisherIEEE-
dc.relation.ispartofProceedings of The International Symposium on Multiple-Valued Logicen
dc.subjectFast algorithms | Galois field expressions | GPU computing | Spectral transformsen
dc.titleConstant geometry algorithms for galois field expressions and their implementation on GPUsen
dc.typeConference Paperen
dc.relation.conference44th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2014; Bremen; Germany; 19 May 2014 through 21 May 2014-
dc.identifier.doi10.1109/ISMVL.2014.22en
dc.identifier.scopus2-s2.0-84904471951en
dc.relation.firstpage79en
dc.relation.lastpage84en
item.cerifentitytypePublications-
item.openairetypeConference Paper-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
Show simple item record

SCOPUSTM   
Citations

4
checked on May 22, 2024

Page view(s)

36
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.