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.<<ETX>>
[1]
K. L. Ho,et al.
Polynomial transform fast Hartley transform
,
1990
.
[2]
Izidor Gertner.
A new efficient algorithm to compute the two-dimensional discrete Fourier transform
,
1988,
IEEE Trans. Acoust. Speech Signal Process..
[3]
Dekun Yang,et al.
New fast algorithm to compute two-dimensional discrete Hartley transform
,
1989
.
[4]
Dekun Yang.
Fast discrete radon transform and 2-D discrete Fourier transform
,
1990
.
[5]
R. Bracewell,et al.
Fast two-dimensional Hartley transform
,
1986,
Proceedings of the IEEE.