Abstract
A scheme for interpolation of discrete-time signals using the discrete Hartley transform (DHT), is deduced from the existing DFT-based scheme. Besides, a DHT-based fast interpolation algorithm is suggested. A comparative study of arithmetic and time complexities involved in the interpolation using different FFT and FHT algorithms is also presented. It is observed that the computational complexities of the proposed fast interpolation algorithm are significantly less compared with the corresponding FFT-based implementation, as well as the existing DHT-based interpolation. From computer simulation, it is observed that the present Hartley-based scheme is remarkably faster compared with the Fourier-based interpolation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
