arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.06106math.CAcs.NAmath.NA
收藏

关于算术变换和算术Hartley变换的简要综述

A Short Survey on Arithmetic Transforms and the Arithmetic Hartley Transform

Universidade Federal de Pernambuco(巴西联邦伯南布哥大学);Communications Research Group, Departamento de Eletrônica e Sistemas, Universidade Federal de Pernambuco(巴西联邦伯南布哥大学电子与系统系通信研究组)

R. J. Cintra, H. M. de Oliveira

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分析而来,可能存在错误,请以论文正文为准。

↑