Title
A Parallel Algorithm for Enumerating Joint Weight of a Binary Linear Code in Network Coding
Abstract
In this paper, we present a parallel algorithm for enumerating joint weight of a binary linear (n, k) code, aiming at accelerating assessment of its decoding error probability for network coding. To reduce the number of pairs of code words to be investigated, our parallel algorithm reduces dimension k by focusing on the all-one vector included in many practical codes. We also employ a population count instruction to compute joint weight of code words with a less number of instructions. Our algorithm is implemented on a multi-core CPU system and an NVIDIA GPU system using Open MP and compute unified device architecture (CUDA), respectively. We apply our implementation to a sub code of a (127,22) BCH code to evaluate the impact of acceleration.
Year
DOI
Venue
2014
10.1109/CANDAR.2014.23
Computing and Networking
Keywords
Field
DocType
BCH codes,binary codes,error statistics,graphics processing units,linear codes,parallel algorithms,BCH code,CUDA,NVIDIA GPU system,Open MP,all-one vector,binary linear code,code words,compute unified device architecture,decoding error probability,joint weight enumeration,multicore CPU system,network coding,parallel algorithm,population count instruction
Constant-weight code,Computer science,Systematic code,Parallel computing,Polynomial code,Code word,Linear code,Prefix code,Variable-length code,Dual code
Conference
Citations 
PageRank 
References 
1
0.38
8
Authors
4
Name
Order
Citations
PageRank
Shohei Ando110.38
Fumihiko Ino231738.63
Toru Fujiwara36316.94
Kenichi Hagihara452856.94