DocumentCode
1352470
Title
Multidimensional polynomial transform algorithm for multidimensional DFT
Author
Cheng, Lizhi ; Zeng, Yonghong
Author_Institution
Dept. of Math. & Syst. Sci., Nat. Univ. of Defence Technol., Hunan, China
Volume
36
Issue
11
fYear
2000
fDate
5/25/2000 12:00:00 AM
Firstpage
990
Lastpage
991
Abstract
A method is presented for converting the m-dimensional discrete Fourier transform (MD-DFT) into a number of one-dimensional DFTs (1D-DFTs) by rearranging the order of the input sequence. The result of this conversion is that the number of multiplications for computing an m-dimensional DFT is only 1/m times that of the usually used row-column DFT algorithm. To reduce the number of additions, a multidimensional polynomial transform (MD-PT) is then used and a considerable saving in the number of addition operations is also achieved.
Keywords
discrete Fourier transforms; addition operations reduction; discrete Fourier transform; input sequence; multidimensional DFT; multidimensional polynomial transform algorithm; multiplication operations reduction;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:20000698
Filename
849014
Link To Document