New Bit-Level Serial GF (2^m) Multiplication Using Polynomial Basis

2015 ◽  
Author(s):  
Hayssam El-Razouk ◽  
Arash Reyhani-Masoleh
Keyword(s):  
Polynomial Basis

scholarly journals Efficient Nonrecursive Bit-Parallel Karatsuba Multiplier for a Special Class of Trinomials

VLSI Design ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Yin Li ◽  
Yu Zhang ◽  
Xiaoli Guo
Keyword(s):  
Time Delay ◽  
Special Class ◽  
Time Complexity ◽  
Space Complexity ◽  
Polynomial Basis ◽  
Gate Delay ◽  
Complexity Bound ◽  
Parallel Multiplier ◽  
Highly Efficient ◽  
First Time

Recently, we present a novel Mastrovito form of nonrecursive Karatsuba multiplier for all trinomials. Specifically, we found that related Mastrovito matrix is very simple for equally spaced trinomial (EST) combined with classic Karatsuba algorithm (KA), which leads to a highly efficient Karatsuba multiplier. In this paper, we consider a new special class of irreducible trinomial, namely, xm+xm/3+1. Based on a three-term KA and shifted polynomial basis (SPB), a novel bit-parallel multiplier is derived with better space and time complexity. As a main contribution, the proposed multiplier costs about 2/3 circuit gates of the fastest multipliers, while its time delay matches our former result. To the best of our knowledge, this is the first time that the space complexity bound is reached without increasing the gate delay.

scholarly journals A Novel Meshfree Approach with a Radial Polynomial for Solving Nonhomogeneous Partial Differential Equations

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 270
Author(s):  
Cheng-Yu Ku ◽  
Jing-En Xiao ◽  
Chih-Yu Liu
Keyword(s):  
Partial Differential Equations ◽  
Differential Equations ◽  
Radial Basis Function ◽  
Collocation Method ◽  
Basis Function ◽  
Numerical Solutions ◽  
Polynomial Basis ◽  
Partial Differential ◽  
Minimum Order ◽  
Radial Basis

In this article, a novel radial–based meshfree approach for solving nonhomogeneous partial differential equations is proposed. Stemming from the radial basis function collocation method, the novel meshfree approach is formulated by incorporating the radial polynomial as the basis function. The solution of the nonhomogeneous partial differential equation is therefore approximated by the discretization of the governing equation using the radial polynomial basis function. To avoid the singularity, the minimum order of the radial polynomial basis function must be greater than two for the second order partial differential equations. Since the radial polynomial basis function is a non–singular series function, accurate numerical solutions may be obtained by increasing the terms of the radial polynomial. In addition, the shape parameter in the radial basis function collocation method is no longer required in the proposed method. Several numerical implementations, including homogeneous and nonhomogeneous Laplace and modified Helmholtz equations, are conducted. The results illustrate that the proposed approach may obtain highly accurate solutions with the use of higher order radial polynomial terms. Finally, compared with the radial basis function collocation method, the proposed approach may produce more accurate solutions than the other.

Sign in / Sign up

Export Citation Format

Share Document