Paper Info
Title
Parallel Computation of Division over GF(2^n) Covering Divide-by-Zero Based on Tile Assembly Model
Abstract
This paper proposes how to compute division over finite field GF(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> ) that could cover the case of zero divisor based on tile assembly model. Key functions are accomplished by combining n final configurations of two different sub-models. The final configuration of every sub-model contains 2n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> -n computation tiles which perform 10 different functions. The coding ways of most computation tiles are optimized than the previous model to improve the complexity. The highest bit of modulus number is omitted to simplify the encoding way of computation tiles in the assembly process. This model requires 4591 types of computation tiles and 13 types of boundary tiles. The assembly time complexity is 2n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> -1 and the space complexity is n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> .
Year
DOI
Venue
2019
10.1109/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00080
2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)
Keywords
DocType
ISBN
Finite field GF(2^n), Tile assembly model, Parallel computing, Division, Divide-by-zero
Conference
978-1-7281-4329-3
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Yongnan Li1268.35
Limin Xiao223147.05