Cellular Recursive Algorithm Architecture for Long Integers Multiplication in Arrays of Restricted Size

  • Authors:

  • Valentina Markova

  • Affiliations:

  • -

  • Venue:
  • PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new cellular recursive algorithm architecture for multiplication of two long binary integers in arrays of restricted size is presented. The new algorithm is based on "divide and conquer" technique and performed in terms of a model of fine-grained parallelism - Parallel Substitution Algorithm. Time complexity of the new cellular recursive algorithm for multiplication of two long binary integers is obtained.