By Topic

Fast discrete radon transform and 2-D discrete Fourier 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 $31
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

1 Author(s)
Yang, D. ; Dept. of Radio Eng., South China Univ. of Technol., Guangdong, China

The discrete Radon transform (DRT) has been known to convert two-dimensional discrete Fourier transforms (2-D DFTs) into 1-D DFTs. A fast discrete Radon transform (FDRT) algorithm is presented. A FDRT-based algorithm is presented for computing 2-D DFTs, which has the advantages of having the lowest number of multiplications and being more suitable for parallel implementation compared with other related algorithms.

Published in:

Electronics Letters  (Volume:26 ,  Issue: 8 )