Results 101 to 110 of about 12,586,529 (117)
Mastrovito Form of Non-Recursive Karatsuba Multiplier for All Trinomials [PDF]
IEEE Transactions on Computers, 2017 We present a new type of bit-parallel non-recursive Karatsuba multiplier over $GF(2^m)$ generated by an arbitrary irreducible trinomial. This design effectively exploits Mastrovito approach and shifted polynomial basis (SPB) to reduce the time complexity
Yu Zhang, Yin Li
exaly +2 more sources
Fast Hybrid Karatsuba Multiplier for Type II Pentanomials [PDF]
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2020 We continue the study of Mastrovito form of Karatsuba multipliers under the shifted polynomial basis (SPB), recently introduced by Li et al. (IEEE TC (2017)).
Yu Zhang, Yin Li, Wei He
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mastrovito Multiplier for General Irreducible Polynomials
IEEE Transactions on Computers, 2000C K Koc
exaly
N-Term Karatsuba Algorithm and Its Application to Multiplier Designs for Special Trinomials
IEEE Access, 2018Yu Zhang, Yin Li
exaly
Low-Complexity Modified Mastrovito Multipliers Over Finite Fields GF(2^(M))
1999K K Parhi, Leilei Song
exaly
New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over GF(2ⁿ)
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2012Seokhie Hong +2 more
exaly