DocumentCode :
2306967
Title :
Fast computation of two-dimensional discrete Fourier transform using fast discrete Radon transform
Author :
Yang, Dekun
Author_Institution :
Dept. of Radio Eng., South China Univ. of Technol., Guangzhou, China
fYear :
1990
fDate :
24-27 Sep 1990
Firstpage :
207
Abstract :
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
Keywords :
fast Fourier transforms; parallel algorithms; transforms; 2-D DFT; VLSI; additions; algorithm; computation speed; fast discrete Radon transform; multiplications; odd DFT; parallel algorithm; parallel processing; parallel structure; two-dimensional discrete Fourier transform; Arithmetic; Birth disorders; Concurrent computing; Discrete Fourier transforms; Fast Fourier transforms; Fourier transforms; Parallel architectures; Polynomials; Signal processing algorithms; Two dimensional displays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer and Communication Systems, 1990. IEEE TENCON'90., 1990 IEEE Region 10 Conference on
Print_ISBN :
0-87942-556-3
Type :
conf
DOI :
10.1109/TENCON.1990.152600
Filename :
152600
Link To Document :
بازگشت