Karatsuba algorithm

The Karatsuba algorithm is a fast multiplication algorithm. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It reduces the multiplication of two n-digit numbers to at most $n^{\log _{2}3}\approx n^{1.585}$ single-digit multiplications in general (and exactly $n^{\log _{2}3}$ when n is a power of 2). It is therefore faster than the classical algorithm, which requires n² single-digit products. For example, the Karatsuba algorithm requires 3¹⁰ = 59,049 single-digit multiplications to multiply two 1024-digit numbers (n = 1024 = 2¹⁰), whereas the classical algorithm requires (2¹⁰)² = 1,048,576 (a speedup of 17.75 times).

The Karatsuba algorithm was the first multiplication algorithm asymptotically faster than the quadratic "grade school" algorithm. The Toom–Cook algorithm is a faster generalization of Karatsuba's method, and the Schönhage–Strassen algorithm is even faster, for sufficiently large n.

History

The standard procedure for multiplication of two n-digit numbers requires a number of elementary operations proportional to $n^{2}\,\!$, or $O(n^{2})\,\!$ in big-O notation. Andrey Kolmogorov conjectured that the classical algorithm was asymptotically optimal, meaning that any algorithm for that task would require $\Omega (n^{2})\,\!$ elementary operations.

In 1960, Kolmogorov organized a seminar on mathematical problems in cybernetics at the Moscow State University, where he stated the $\Omega (n^{2})\,\!$ conjecture and other problems in the complexity of computation. Within a week, Karatsuba, then a 23-year-old student, found an algorithm (later it was called "divide and conquer") that multiplies two n-digit numbers in $O(n^{\log _{2}3})$ elementary steps, thus disproving the conjecture. Kolmogorov was very excited about the discovery; he communicated it at the next meeting of the seminar, which was then terminated. Kolmogorov gave some lectures on the Karatsuba result at conferences all over the world (see, for example, "Proceedings of the International Congress of Mathematicians 1962", pp. 351–356, and also "6 Lectures delivered at the International Congress of Mathematicians in Stockholm, 1962") and published the method in 1962, in the Proceedings of the USSR Academy of Sciences. The article had been written by Kolmogorov and contained two results on multiplication, Karatsuba's algorithm and a separate result by Yuri Ofman; it listed "A. Karatsuba and Yu. Ofman" as the authors. Karatsuba only became aware of the paper when he received the reprints from the publisher.

Algorithm

Basic step

The basic step of Karatsuba's algorithm is a formula that allows one to compute the product of two large numbers $x$ and $y$ using three multiplications of smaller numbers, each with about half as many digits as $x$ or $y$, plus some additions and digit shifts. This basic step is, in fact, a generalization of Gauss's complex multiplication algorithm, where the imaginary unit i is replaced by a power of the base.

Let $x$ and $y$ be represented as $n$-digit strings in some base $B$. For any positive integer $m$ less than $n$, one can write the two given numbers as

$x=x_{1}B^{m}+x_{0},$

$y=y_{1}B^{m}+y_{0},$

where $x_{0}$ and $y_{0}$ are less than $B^{m}$. The product is then

$xy=(x_{1}B^{m}+x_{0})(y_{1}B^{m}+y_{0}),$

$xy=z_{2}B^{2m}+z_{1}B^{m}+z_{0},$

where

$z_{2}=x_{1}y_{1},$

$z_{1}=x_{1}y_{0}+x_{0}y_{1},$

$z_{0}=x_{0}y_{0}.$

These formulae require four multiplications and were known to Charles Babbage. Karatsuba observed that $xy$ can be computed in only three multiplications, at the cost of a few extra additions. With $z_{0}$ and $z_{2}$ as before one can calculate

$z_{1}=(x_{1}+x_{0})(y_{1}+y_{0})-z_{2}-z_{0},$

which holds, since

$z_{1}=x_{1}y_{0}+x_{0}y_{1},$

$z_{1}=(x_{1}+x_{0})(y_{1}+y_{0})-x_{1}y_{1}-x_{0}y_{0}.$

An issue that occurs, however, when computing $z_{1}$ is that the above computation of $(x_{1}+x_{0})$ and $(y_{1}+y_{0})$ may result in overflow (will produce a result in the range $0\leq {\text{result}}<2B^{m}$), which require a multiplier having one extra bit. This can be avoided by noting that

$z_{1}=(x_{1}+x_{0})(y_{1}+y_{0})-x_{1}y_{1}-x_{0}y_{0},$

$z_{1}=(x_{1}y_{1}+x_{1}y_{0}+x_{0}y_{1}+x_{0}y_{0})-x_{1}y_{1}-x_{0}y_{0},$

$z_{1}=(-x_{1}y_{1}+x_{1}y_{0}+x_{0}y_{1}-x_{0}y_{0})+x_{1}y_{1}+x_{0}y_{0},$

$z_{1}=-(x_{1}y_{1}-x_{1}y_{0}-x_{0}y_{1}+x_{0}y_{0})+x_{1}y_{1}+x_{0}y_{0},$

$z_{1}=-(x_{1}-x_{0})(y_{1}-y_{0})+x_{1}y_{1}+x_{0}y_{0},$

$z_{1}=(x_{0}-x_{1})(y_{1}-y_{0})+x_{1}y_{1}+x_{0}y_{0}.$

This computation of $(x_{0}-x_{1})$ and $(y_{1}-y_{0})$ will produce a result in the range of $-B^{m}<{\text{result}}<B^{m}$. This method may produce negative numbers, which require one extra bit to encode signedness, and would still require one extra bit for the multiplier. However, one way to avoid this is to record the sign and then use the absolute value of $(x_{0}-x_{1})$ and $(y_{1}-y_{0})$ to perform an unsigned multiplication, after which the result may be negated when both signs originally differed. Another advantage is that even though $(x_{0}-x_{1})(y_{1}-y_{0})$ may be negative, the final computation of $z_{1}$ only involve additions.

Example

To compute the product of 12345 and 6789, where B = 10, choose m = 3. Then we decompose the input operands using the resulting base (B^m = 1000), as:

12345 = 12 · 1000 + 345

6789 = 6 · 1000 + 789

Only three multiplications, which operate on smaller integers, are used to compute three partial results:

z₂ = 12 × 6 = 72

z₀ = 345 × 789 = 272205

z₁ = (12 + 345) × (6 + 789) − z₂ − z₀ = 357 × 795 − 72 − 272205 = 283815 − 72 − 272205 = 11538

We get the result by just adding these three partial results, shifted accordingly (and then taking carries into account by decomposing these three inputs in base 1000 like for the input operands):

result = z₂ · (B^m)² + z₁ · (B^m)¹ + z₀ · (B^m)⁰, i.e.

result = 72 · 1000² + 11538 · 1000 + 272205 = 83810205.

Note that the intermediate third multiplication operates on an input domain which is less than two times larger than for the two first multiplications, its output domain is less than four times larger, and base-1000 carries computed from the first two multiplications must be taken into account when computing these two subtractions.

Recursive application

If n is four or more, the three multiplications in Karatsuba's basic step involve operands with fewer than n digits. Therefore, those products can be computed by recursive calls of the Karatsuba algorithm. The recursion can be applied until the numbers are so small that they can (or must) be computed directly.

In a computer with a full 32-bit by 32-bit multiplier, for example, one could choose B = 2³¹ = 7009214748364800000♠2147483648, and store each digit as a separate 32-bit binary word. Then the sums x₁ + x₀ and y₁ + y₀ will not need an extra binary word for storing the carry-over digit (as in carry-save adder), and the Karatsuba recursion can be applied until the numbers to multiply are only one-digit long.

Asymmetric Karatsuba-like formulae

Karatsuba's original formula and other generalizations are themselves symmetric. For example, the following formula computes

$c(x)=c_{4}x^{4}+c_{3}x^{3}+c_{2}x^{2}+c_{1}x+c_{0}=a(x)b(x)=(a_{2}x^{2}+a_{1}x+a_{0})(b_{2}x^{2}+b_{1}x+b_{0})$

with 6 multiplications in ${\text{GF}}(2)[x]$, where ${\text{GF}}(2)$ is the Galois field with two elements 0 and 1.

${\begin{aligned}\left\{{\begin{array}{l}c_{0}=p_{0},\\c_{1}=p_{012}+p_{02}+p_{12}+p_{2},\\c_{2}=p_{012}+p_{01}+p_{12},\\c_{3}=p_{012}+p_{01}+p_{02}+p_{0},\\c_{4}=p_{2},\end{array}}\right.\end{aligned}}$

where $p_{i}=a_{i}b_{i},\ \ p_{ij}=(a_{i}+a_{j})(b_{i}+b_{j})$ and $p_{ijk}=(a_{i}+a_{j}+a_{k})(b_{i}+b_{j}+b_{k})$. We note that addition and subtraction are the same in fields of characteristic 2.

This formula is symmetrical, namely, it does not change if we exchange $a$ and $b$ in $p_{i},\ \ p_{ij}$ and $p_{ijk}$.

Based on the second Generalized division algorithms , Fan et al. found the following asymmetric formula:

${\begin{aligned}\left\{{\begin{array}{l}c_{0}=p_{0}\\c_{1}=p_{012}+p_{2}+m_{4}+m_{5}\\c_{2}=p_{012}+m_{3}+m_{5}\\c_{3}=p_{012}+p_{0}+m_{3}+m_{4}\\c_{4}=p_{2},\end{array}}\right.\end{aligned}}$

where $m_{3}=(a_{1}+a_{2})(b_{0}+b_{2}),\ \ m_{4}=(a_{0}+a_{1})(b_{1}+b_{2})$ and $m_{5}=(a_{0}+a_{2})(b_{0}+b_{1})$.

It is asymmetric because we can obtain the following new formula by exchanging $a$ and $b$ in $m_{3},\ \ m_{4}$ and $m_{5}$.

${\begin{aligned}\left\{{\begin{array}{l}c_{0}=p_{0}\\c_{1}=p_{012}+p_{2}+m_{4}+m_{5}\\c_{2}=p_{012}+m_{3}+m_{5}\\c_{3}=p_{012}+p_{0}+m_{3}+m_{4}\\c_{4}=p_{2},\end{array}}\right.\end{aligned}}$

where $m_{3}=(a_{0}+a_{2})(b_{1}+b_{2}),\ \ m_{4}=(a_{1}+a_{2})(b_{0}+b_{1})$ and $m_{5}=(a_{0}+a_{1})(b_{0}+b_{2})$.

Efficiency analysis

Karatsuba's basic step works for any base B and any m, but the recursive algorithm is most efficient when m is equal to n/2, rounded up. In particular, if n is 2^k, for some integer k, and the recursion stops only when n is 1, then the number of single-digit multiplications is 3^k, which is n^c where c = log₂3.

Since one can extend any inputs with zero digits until their length is a power of two, it follows that the number of elementary multiplications, for any n, is at most $3^{\lceil \log _{2}n\rceil }\leq 3n^{\log _{2}3}\,\!$.

Since the additions, subtractions, and digit shifts (multiplications by powers of B) in Karatsuba's basic step take time proportional to n, their cost becomes negligible as n increases. More precisely, if t(n) denotes the total number of elementary operations that the algorithm performs when multiplying two n-digit numbers, then

$T(n)=3T(\lceil n/2\rceil )+cn+d$

for some constants c and d. For this recurrence relation, the master theorem for divide-and-conquer recurrences gives the asymptotic bound $T(n)=\Theta (n^{\log _{2}3})\,\!$.

It follows that, for sufficiently large n, Karatsuba's algorithm will perform fewer shifts and single-digit additions than longhand multiplication, even though its basic step uses more additions and shifts than the straightforward formula. For small values of n, however, the extra shift and add operations may make it run slower than the longhand method. The point of positive return depends on the computer platform and context. As a rule of thumb, Karatsuba's method is usually faster when the multiplicands are longer than 320–640 bits.

Pseudocode

procedure karatsuba(num1, num2)
  if (num1 < 10) or (num2 < 10)
    return num1*num2
  /* calculates the size of the numbers */
  m = min(size_base10(num1), size_base10(num2))
  m2 = floor(m/2)
  /*m2 = ceil(m/2) will also work */
  /* split the digit sequences in the middle */
  high1, low1 = split_at(num1, m2)
  high2, low2 = split_at(num2, m2)
  /* 3 calls made to numbers approximately half the size */
  z0 = karatsuba(low1, low2)
  z1 = karatsuba((low1 + high1), (low2 + high2))
  z2 = karatsuba(high1, high2)
  return (z2 * 10 ^ (m2 * 2)) + ((z1 - z2 - z0) * 10 ^ m2) + z0

In practice, the choice of the optimal base case is machine specific.

External links

• Karatsuba's Algorithm for Polynomial Multiplication
• Weisstein, Eric W. "Karatsuba Multiplication". MathWorld.
• Bernstein, D. J., "Multidigit multiplication for mathematicians". Covers Karatsuba and many other multiplication algorithms.