DocumentCode :
3272855
Title :
An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform
Author :
Lun, Daniel Pak-Kong ; Siu, Wan-chi
Author_Institution :
Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong
Volume :
2
fYear :
1992
fDate :
10-13 May 1992
Firstpage :
726
Abstract :
Presents a novel algorithm for the computation of the two-dimensional discrete Fourier transform and discrete Hartley transform. By using the discrete Radon transform (DRT), the algorithm essentially converts the two-dimensional transforms into a number of one-dimensional ones. By totally eliminating all redundant operations during the computation of the DRT, the algorithm can give an average of 20% reduction in the number of additions as compared to previous approaches which are also based on the DRT. In fact, it has the same arithmetic complexity as the fastest algorithms which use the polynomial transform for their decompositions. However, the present approach has the advantage over the ones using the polynomial transform in that it can easily be realized
Keywords :
fast Fourier transforms; transforms; DRT; arithmetic complexity; discrete Hartley transform; discrete Radon transform; fast Radon transform algorithm; two-dimensional discrete Fourier transform; Algorithm design and analysis; Arithmetic; Digital signal processing; Discrete Fourier transforms; Discrete transforms; Discrete wavelet transforms; Fast Fourier transforms; Polynomials; Signal processing algorithms; Two dimensional displays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7803-0593-0
Type :
conf
DOI :
10.1109/ISCAS.1992.230149
Filename :
230149
Link To Document :
بازگشت