A Parallel Algorithm for Computing the Weight Spectrum of Binary Linear Codes

We present a parallel SIMD (Single Instruction Multiple Data) algorithm for computing the weight spectrum of binary linear [n,k] codes using GPU (Graphics Processing Units) and CUDA (Compute Unified Device Architecture) programming platform. This algorithm is based on characteristic vector and Walsh...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2020 Algebraic and Combinatorial Coding Theory (ACCT) s. 1 - 5
Hlavní autori: Pashinska, Maria, Bouyukliev, Iliya
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 11.10.2020
Predmet:
CUDA
Graphics processing units
linear code
Linear codes
Parallel algorithms
Programming
Sorting
Transforms
Walsh-Hadamard transform
weight spectrum algorithm
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present a parallel SIMD (Single Instruction Multiple Data) algorithm for computing the weight spectrum of binary linear [n,k] codes using GPU (Graphics Processing Units) and CUDA (Compute Unified Device Architecture) programming platform. This algorithm is based on characteristic vector and Walsh-Hadamard transform and does not depend on the length of the code. We compare it with standard consecutive algorithms and give some experimental results.
DOI:10.1109/ACCT51235.2020.9383351