DocumentCode :
980605
Title :
Fast interpolation algorithm using fast Hartley transform
Author :
Agbinya, Johnson I.
Author_Institution :
University of Jos, Makurdi, Nigeria
Volume :
75
Issue :
4
fYear :
1987
fDate :
4/1/1987 12:00:00 AM
Firstpage :
523
Lastpage :
524
Abstract :
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.
Keywords :
Analog computers; Content addressable storage; Discrete transforms; Fast Fourier transforms; Frequency conversion; Interpolation; Low pass filters; Mean square error methods; Signal processing algorithms; Signal sampling;
fLanguage :
English
Journal_Title :
Proceedings of the IEEE
Publisher :
ieee
ISSN :
0018-9219
Type :
jour
DOI :
10.1109/PROC.1987.13762
Filename :
1458029
Link To Document :
بازگشت