Fast interpolation algorithm using fast Hartley transform
Johnson Ihyeh Agbinya · Proceedings of the IEEE · 1987
The use of fast Hartley transform for fast discrete interpolation is considered. The computational method uses the sprit-radix algorithm which requires the least number of operations compared with other Hartley algorithms. Results from this method are compared with those using the fast Fourier transform.