Synthesis Comparison of Karatsuba Multiplierusing Polynomial Multiplication, Vedic Multiplier and Classical Multiplier

Mishra, Sudhanshu; Pradhan, Manoranjan
March 2012
International Journal of Computer Applications;Mar2012, Vol. 41, p13
Academic Journal
In this paper, the authors have compared the efficiency of the Karatsuba multiplier using polynomial multiplication with the multiplier implementing Vedic mathematics formulae (sutras), specifically the Nikhilam sutra. The multipliers have been implemented using Spartan 2 xc2s200 pq208 FPGA device having speed grade of -6. The proposed Karatsuba multiplier has been found to have better efficiency than the multipliers involving Vedic mathematics formulae.


Related Articles

  • Best multiplier Approximation in Lp,Øn(B). AL-Saidy, Saheb K.; AL-Jawari, Naseif J.; Zaboon, Ali H. // Al-Mustansiriyah Journal of Science;2019, Vol. 30 Issue 2, p27 

    The purpose of this paper is to find best multiplier approximation of unbounded functions in Lp,Øn( –space by using Trigonometric polynomials and by de la Vallee- Poussin operators. Also we will estimate the degree of the best multiplier approximation by Weighted –Ditzian-Totik...

  • Design of Hybrid Multiplier and Inversion Unit Over GF(2m). Min-sup Kang // Journal of Security Engineering; 

    In ECC algorithm, the most time consuming part is scalar multiplication that can be computed by point addition, multiplication and inversion operation. In this paper, we propose a advanced Hybrid multiplier over GF(2m) for realizing fast computation speed. The proposed multiplier uses a...

  • The projective unitary irreducible representations of the Galilei group in 1+2 dimensions. Grigore, D. R. // Journal of Mathematical Physics;Jan1996, Vol. 37 Issue 1, p460 

    We give an elementary analysis of the multiplicator group of the Galilei group in 1+2 dimensions G[sup ↑, sub +]. For a nontrivial multiplicator we give a list of all the corresponding projective unitary irreducible representations of G[sup ↑, sub +].

  • Low-complexity finite field multiplier using irreducible trinomials. Chiou, C.W.; Lin, L.C.; Chou, F.H.; Shu, S. F. // Electronics Letters;11/27/2003, Vol. 39 Issue 24, p1709 

    A low-complexity array multiplier for GF(2[SUPm]) fields with an irreducible trinomial X[SUPm] + X[SUPn] + 1 is presented. The space complexity of the proposed multiplier is reduced from order O(m[SUP2]) to O(m) compared with the Lee's array multiplier. The time complexity of the proposed...

  • MODIFIED VARIATIONAL ITERATION METHOD FOR SCHRODINGER EQUATIONS. Mohyud-Din, Syed Tauseef; Noor, Muhammad Aslam; Noor, Khalida Inayat // Mathematical & Computational Applications;Dec2010, Vol. 15 Issue 3, p309 

    In this paper, we apply the modified variational iteration method (MVIM) for solving Schrödinger equations. The proposed modification is made by introducing He's polynomials in the correction functional of variational iteration method (VIM). The suggested iterative scheme finds the solution...

  • (Xd;Xd* )-BESSEL MULTIPLIERS IN BANACH SPACES. HASAN FAROUGHI, MOHAMMAD; OSGOOEI, ELNAZ; RAHIMI, ASGHAR // Banach Journal of Mathematical Analysis;2013, Vol. 7 Issue 2, p146 

    Multipliers have recently been introduced as operators for Bessel sequences and frames in Hilbert spaces. In this paper, we define the concept of (Xd,Xd* ) and (l∞, Xd,Xd* )-Bessel multipliers in Banach spaces and investigate the compactness of these multipliers. Also, we study the...

  • On the normalizing multiplier of the generalized Jackson kernel. Vyazovskaya, M. S.; Pupashenko, N. S. // Mathematical Notes;Jul/Aug2006, Vol. 80 Issue 1/2, p19 

    We consider the question of evaluating the normalizing multiplier for the generalized Jackson kernel J n,k ( t). We obtain the explicit formula and the representation , where .

  • Spectral Multipliers for Hardy Spaces Associated with Schrödinger Operators with Polynomial Potentials. Dziubański, Jacek // Bulletin of the London Mathematical Society;2000, Vol. 32 Issue 5, p571 

    Let Tt be the semigroup of linear operators generated by a Schrödinger operator − A = Δ − V, where V is a non-negative polynomial, and let ∫0∞λdEA(λ) be the spectral resolution of A. We say that f is an element of HAp if the maximal function Mf(x) =...

  • An Efficient Multiplier/Divider Design for Elliptic Curve Cryptosystem over GF(2m ). MING-DER SHIEH; JUN-HONG CHEN; WEN-CHING LIN; CHIEN-MING WU // Journal of Information Science & Engineering;Sep2009, Vol. 25 Issue 5, p1555 

    Using the concept of reciprocal polynomial, this paper shows that a field multiplication over GF(2m) can be implemented by extended Stein's algorithm, one of the algorithms used to accomplish division. In this way, a field multiplier can be efficiently embedded into a divider with very little...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics