Zobrazeno 1 - 10
of 268
pro vyhledávání: '"parallel multiplier"'
Publikováno v:
Journal of Universal Computer Science, Vol 28, Iss 10, Pp 1030-1057 (2022)
Multiplication is considered one of the most time-consuming and a key operation in wide variety of embedded applications. Speeding up this operation has a significant impact on the overall performance of these applications. A vast number of multiplic
Externí odkaz:
https://doaj.org/article/bf5a0ec89b444d4eb1cb1b1edd5251e6
Autor:
Valinataj, Mojtaba a, ∗, Jantsch, Axel b
Publikováno v:
In Microelectronics Journal July 2022 125
Publikováno v:
IEEE Access, Vol 10, Pp 11372-11381 (2022)
Decimal computation is highly demanded in many human-centric applications such as banking, accounting, tax calculation, and currency conversion. Hence the design and implementation of radix-10 arithmetic units attract the attention of many researcher
Externí odkaz:
https://doaj.org/article/b52426e587924c72bfee9db4bd88417b
Autor:
Pillutla, Siva Ramakrishna ∗, Boppana, Lakshmi
Publikováno v:
In Microelectronics Journal March 2020 97
Publikováno v:
In Materials Today: Proceedings 2020 33 Part 7:3692-3696
Space Efficient $GF(2^m)$ Multiplier for Special Pentanomials Based on $n$ -Term Karatsuba Algorithm
Publikováno v:
IEEE Access, Vol 8, Pp 27342-27360 (2020)
Recently, new multiplication schemes over the binary extension field GF(2m) based on an n-term Karatsuba algorithm have been proposed for irreducible trinomials. In this paper, we extend these schemes for trinomials to any irreducible polynomials. We
Externí odkaz:
https://doaj.org/article/ba391f2954334f7abf850a2492266664
Publikováno v:
IEEE Access, Vol 8, Pp 173491-173507 (2020)
Recently, hybrid multiplication schemes over the binary extension field $GF(2^{m})$ based on $n$ -term Karatsuba algorithm (KA) have been proposed for irreducible trinomials. Their complexities depend on a decomposition of $m$ and the choice of a gen
Externí odkaz:
https://doaj.org/article/70fbca0e60ac43e98eae7319ae38a59d
Publikováno v:
IEEE Access, Vol 7, Pp 27047-27064 (2019)
We propose bit-parallel GF(2m) multipliers for irreducible trinomials using an n-term Karatsuba algorithm and Mastrovito approach, which are generalizations of the newly proposed multiplication scheme for a specific trinomial. The complexities of the
Externí odkaz:
https://doaj.org/article/8a5672dbef2a4bd08ce36da3f338199e
Autor:
Diaz, Carlos, Frias, Thania, Sanchez, Giovanny ⁎, Perez, Hector, Toscano, Karina, Duchen, Gonzalo
Publikováno v:
In Neurocomputing 24 May 2017 239:113-121
Publikováno v:
IEEE Access, Vol 6, Pp 43056-43069 (2018)
In this paper, we propose a new type of non-recursive Mastrovito multiplier for GF(2m) using an n-term Karatsuba algorithm (KA), where GF(2m) is defined by an irreducible trinomial, xm+xk +1, m = nk. We show that such a type of trinomial combined wit
Externí odkaz:
https://doaj.org/article/475fc61dc9c0430ea6953b8e91aa3a3f