Multiplication algorithm

Known as: Multiplication algorithms, FFT multiplication, Shift and add algorithm 
A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
For more than 35 years, the fastest known method for integer multiplication has been the Schönhage-Strassen algorithm running in… (More)
  • figure 11
  • table 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery’s method adapted to… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper discusses several Montgomery multiplication algorithms, two of which have been proposed before. We describe three… (More)
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Hardware is described for implementing the fast modular multiplication algorithm of P. L. Montgomery. Comparison with previous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
This paper describes the Parallel Universal Matrix Multiplication Algorithms (PUMMA) on distributed memory concurrent computers… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Finite field arithmetic logic is central in the implementation of Reed-Solomon coders and in some cryptographic algorithms. There… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A high-speed VLSI multiplication algorithm internally using redundant binary representation is proposed. In n bit binary integer… (More)
  • table I
  • figure 3
  • table II
  • figure 4
  • table III
Is this relevant?
Highly Cited
1978
Highly Cited
1978
Let A and B be two sparse matrices whose orders are p by q and q by r. Their product C -A B requires N nontrlvial multiplications… (More)
  • table I
  • table III
  • table IV
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
1974
Highly Cited
1974
Addison-Wesley Pub. Co., 1974, , 470 pages. With this text, you gain an understanding of the fundamental concepts of algorithms… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
An algorithm for high-speed, two's complement, m-bit by n-bit parallel array multiplication is described. The two's complement… (More)
Is this relevant?