A Short Survey on Arithmetic Transforms and the Arithmetic Hartley Transform
classification
🧮 math.CA
cs.NAmath.NA
keywords
arithmetictransformhartleyalgorithmscomputingtheorytransformscomplexity
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.