By Topic

Fast computation of two-dimensional discrete Fourier transform using fast discrete Radon 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
$33 $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

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

The author presents a new decomposition in which the two-dimensional discrete Fourier transform (2-D DFT) can be converted into a series of the odd DFT using the discrete Radon transform (DRT). Moreover, the author presents a fast DRT (FDRT) algorithm for computing DRT with a reduced number of additions. As a result, an FDRT-based 2-D DFT algorithm is presented. The regularity and parallel structure of this algorithm make it of great practical value for implementation in VLSI and parallel processing environments. This FDRT-based 2-D DFT algorithm has the same minimal known number of multiplications and slightly more additions compared with other 2-D DFT algorithms. In parallel implementation, the FDRT-based algorithm increases the computation speed greatly

Published in:

Computer and Communication Systems, 1990. IEEE TENCON'90., 1990 IEEE Region 10 Conference on

Date of Conference:

24-27 Sep 1990