多项式:二进制离散卷积长度缩减的新工具
Polynomials: a new tool for length reduction in binary discrete convolutions
摘要:
稀疏数据的有效处理是计算机科学中的一个关键挑战。二进制卷积,如多项式乘法或沃尔什变换是一个有用的工具,在许多应用中,并有效地解决。在过去的十年中,一些问题需要稀疏二进制卷积的有效解决方案。为了有效地计算稀疏多项式乘法,开发了随机和确定性算法。这些算法的核心操作是长度缩减。稀疏数据被映射到保留卷积结果的小向量。迄今为止使用的归约方法是模函数,因为它保留了(“1”位的)位置直到循环移位。到目前为止,还没有已知的有效算法来计算稀疏沃尔什变换。由于模函数不保留沃尔什变换,需要一种新的方法来减少长度。在本文中,我们提出了这样一种新的方法-多项式。这种方法使一个有效的算法计算的二进制稀疏沃尔什变换的发展。据我们所知,这是第一个这样的算法。我们还表明,这种方法允许更快的确定性计算稀疏多项式乘法比目前已知的文献。
英文摘要:
Efficient handling of sparse data is a key challenge in Computer Science. Binary convolutions, such as polynomial multiplication or the Walsh Transform are a useful tool in many applications and are efficiently solved. In the last decade, several problems required efficient solution of sparse binary convolutions. both randomized and deterministic algorithms were developed for efficiently computing the sparse polynomial multiplication. The key operation in all these algorithms was length reduction. The sparse data is mapped into small vectors that preserve the convolution result. The reduction method used to-date was the modulo function since it preserves location (of the "1" bits) up to cyclic shift. To date there is no known efficient algorithm for computing the sparse Walsh transform. Since the modulo function does not preserve the Walsh transform a new method for length reduction is needed. In this paper we present such a new method - polynomials. This method enables the development of an efficient algorithm for computing the binary sparse Walsh transform. To our knowledge, this is the first such algorithm. We also show that this method allows a faster deterministic computation of sparse polynomial multiplication than currently known in the literature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。