An improved fast Radon transform algorithm for two-dimensional discrete Fourier and Hartley transform

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