arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1811.01490cs.SC
收藏

使用BPAS库实现Fürer算法

Putting Fürer Algorithm into Practice with the BPAS Library

Sviatoslav Covanov, Davood Mohajerani, Marc Moreno-Maza, Lin-Xiao Wang

摘要:

整数和多项式乘法的快速算法在科学计算以及其他学科中起着重要的作用。1971年,Sch{<$}nhage和Strassen设计了一个算法,将两个至多$n$位的整数的乘法时间改进为$\mathcal{O}(\log n \log \log n)$。在2007年,Martin Fürer提出了一个在$O \left(n \log n\ \cdot 2^{O(\log^* n)} \right)$中运行的新算法,其中$\log^* n$是$n$的迭代对数。我们解释了如何将傅勒的思想付诸实践的多项式乘以一个素数领域$\mathbb{Z} / p \mathbb{Z}$,其中$p$是一个广义费马素数的形式$p = r^k + 1$其中$k$是一个权力的$2$和$r$是机器字大小。当$k$至少为8时,我们证明了在这样一个素数域内的乘法可以通过快速傅立叶变换(FFT)有效地实现。利用Cooley-Tukey张量公式和$r$是$\mathbb{Z} / p \mathbb{Z}$中$2k$阶原单位根的事实,得到了$\mathbb{Z} / p \mathbb{Z}$上FFT的有效实现.该实现优于使用$\mathbb{Z} / p \mathbb{Z}$的其他编码或在$\mathbb{Z} / p \mathbb{Z}$中执行乘法的其他方式的可比实现。

英文摘要:

Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{ö}nhage and Strassen designed an algorithm that improved the multiplication time for two integers of at most $n$ bits to $\mathcal{O}(\log n \log \log n)$. In 2007, Martin Fürer presented a new algorithm that runs in $O \left(n \log n\ \cdot 2^{O(\log^* n)} \right)$, where $\log^* n$ is the iterated logarithm of $n$. We explain how we can put Fürer's ideas into practice for multiplying polynomials over a prime field $\mathbb{Z} / p \mathbb{Z}$, for which $p$ is a Generalized Fermat prime of the form $p = r^k + 1$ where $k$ is a power of $2$ and $r$ is of machine word size. When $k$ is at least 8, we show that multiplication inside such a prime field can be efficiently implemented via Fast Fourier Transform (FFT). Taking advantage of Cooley-Tukey tensor formula and the fact that $r$ is a $2k$-th primitive root of unity in $\mathbb{Z} / p \mathbb{Z}$, we obtain an efficient implementation of FFT over $\mathbb{Z} / p \mathbb{Z}$. This implementation outperforms comparable implementations either using other encodings of $\mathbb{Z} / p \mathbb{Z}$ or other ways to perform multiplication in $\mathbb{Z} / p \mathbb{Z}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑