Fast bit-parallel binary multipliers based on type-I pentanomials



Downloads per month over past year

Imaña Pascual, José Luis (2018) Fast bit-parallel binary multipliers based on type-I pentanomials. IEEE Transactions of computer, 67 (6). pp. 898-904. ISSN 0018-9340

[thumbnail of imaña17postprint.pdf]

Official URL:


In this paper, a fast implementation of bit-parallel polynomial basis (PB) multipliers over the binary extension field GF(2^m) generated by type-I irreducible pentanomials is presented. Explicit expressions for the coordinates of the multipliers and a detailed example are given. Complexity analysis shows that the multipliers here presented have the lowest delay in comparison to similar bit-parallel PB multipliers found in the literature based on this class of irreducible pentanomials. In order to prove the theoretical complexities, hardware implementations over Xilinx FPGAs have also been performed. Experimental results show that the approach here presented exhibits the lowest delay with a balanced Area x Time complexity when it is compared with similar multipliers.

Item Type:Article
Additional Information:

©2018 IEEE Computer Society
This work has been supported by the EU (FEDER) and the Spanish MINECO, under grants TIN 2015-65277-R and TIN2012-32180.

Uncontrolled Keywords:General irreducible polynomials; Mastrovito multiplier; Gf(2^m); Trinomials; Design; Fields; Multipliers; Bit-parallel; Polynomial basis; Pentanomials
Subjects:Sciences > Computer science > Artificial intelligence
ID Code:55396
Deposited On:23 May 2019 11:36
Last Modified:23 May 2019 11:36

Origin of downloads

Repository Staff Only: item control page