关于算术变换和算术Hartley变换的简要综述
A Short Survey on Arithmetic Transforms and the Arithmetic Hartley Transform
AI总结:
本文综述了算术变换理论,提出新的算术傅里叶变换算法,并引入算术Hartley变换,强调插值过程对算术变换理论的重要性。
摘要:
算术复杂性在谱评估算法性能中起主要作用。算术变换理论提供了一种用最少乘法次数计算三角变换的方法。本文综述了算术傅里叶变换的算法。提出了一种新的算术变换用于计算离散Hartley变换:算术Hartley变换。插值过程被证明是算术变换理论的关键要素。
英文摘要:
Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the proposed algorithms for the arithmetic Fourier transform are surveyed. A new arithmetic transform for computing the discrete Hartley transform is introduced: the Arithmetic Hartley transform. The interpolation process is shown to be the key element of the arithmetic transform theory.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。