Open Science Research Excellence
@article{(International Science Index):,
  title    = {A Reduced-Bit Multiplication Algorithm for Digital Arithmetic},
  author    = {Harpreet Singh Dhillon and  Abhijit Mitra},
  country   = {},
  abstract  = {A reduced-bit multiplication algorithm based on the ancient Vedic multiplication formulae is proposed in this paper. Both the Vedic multiplication formulae, Urdhva tiryakbhyam and Nikhilam, are first discussed in detail. Urdhva tiryakbhyam, being a general multiplication formula, is equally applicable to all cases of multiplication. It is applied to the digital arithmetic and is shown to yield a multiplier architecture which is very similar to the popular array multiplier. Due to its structure, it leads to a high carry propagation delay in case of multiplication of large numbers. Nikhilam Sutra, on the other hand, is more efficient in the multiplication of large numbers as it reduces the multiplication of two large numbers to that of two smaller numbers. The framework of the proposed algorithm is taken from this Sutra and is further optimized by use of some general arithmetic operations such as expansion and bit-shifting to take advantage of bit-reduction in multiplication. We illustrate the proposed algorithm by reducing a general 4x4-bit multiplication to a single 2 x 2-bit multiplication operation.
    journal   = {International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering},  volume    = {2},
  number    = {7},
  year      = {2008},
  pages     = {1442 - 1447},
  ee        = {},
  url       = {},
  bibsource = {},
  issn      = {eISSN:1307-6892},
  publisher = {World Academy of Science, Engineering and Technology},
  index     = {International Science Index 19, 2008},