Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lun, Daniel Pak-Kong ; Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong ; Wan-Chi Siu,

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

Published in:

Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on  (Volume:2 )

Date of Conference:

10-13 May 1992