特征2域上分圆快速傅里叶变换的计算复杂性
Computational Complexity of Cyclotomic Fast Fourier Transforms over Characteristic-2 Fields
摘要:
分圆快速傅里叶变换是有限域上离散傅里叶变换的有效实现,在密码学和差错控制编码中有着广泛的应用。他们是非常感兴趣的,因为他们的低乘法和整体复杂性。然而,他们的优点是通过检查在文献中,并没有渐近的计算复杂性分析CFFT。它们的高加性复杂度也在硬件实现中引起困难。在本文中,我们推导出的CFFT的乘法和加法复杂性的界限,分别。我们的研究结果证实,CFFTs具有最小的乘法复杂度在所有已知的算法,而其添加剂的复杂性,使他们渐近次优。然而,CFFT仍然是有价值的,因为它们对于大多数实际长度具有最小的总体复杂性。我们的加法复杂性分析还导致了一个结构化的加法网络,它不仅具有低的复杂性,但也适合于硬件实现。
英文摘要:
Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of their low multiplicative and overall complexities. However, their advantages are shown by inspection in the literature, and there is no asymptotic computational complexity analysis for CFFTs. Their high additive complexity also incurs difficulties in hardware implementations. In this paper, we derive the bounds for the multiplicative and additive complexities of CFFTs, respectively. Our results confirm that CFFTs have the smallest multiplicative complexities among all known algorithms while their additive complexities render them asymptotically suboptimal. However, CFFTs remain valuable as they have the smallest overall complexities for most practical lengths. Our additive complexity analysis also leads to a structured addition network, which not only has low complexity but also is suitable for hardware implementations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。