DocumentCode :
1408493
Title :
Efficient algorithm for 2-D arithmetic Fourier transform
Author :
Ge, Xi-Jin ; Chen, Nan-Xian ; Chen, Zhao-Dou
Author_Institution :
Inst. of Appl. Phys., Beijing Univ. of Sci. & Technol., China
Volume :
45
Issue :
8
fYear :
1997
fDate :
8/1/1997 12:00:00 AM
Firstpage :
2136
Lastpage :
2140
Abstract :
This article presents an efficient algorithm for the two-dimensional (2-D) arithmetic Fourier transform (AFT) based on the Mobius inversion formula of odd number series. It requires fewer multiplications and has less complexity over previous algorithms. In addition, a technique is proposed to carry out the on-axis Fourier coefficients. A parallel VLSI architecture is developed for the new algorithm
Keywords :
Fourier transforms; VLSI; digital arithmetic; digital signal processing chips; inverse problems; parallel algorithms; parallel architectures; series (mathematics); signal processing; 2D arithmetic Fourier transform; Mobius inversion formula; efficient algorithm; multiplications; odd number series; on-axis Fourier coefficients; parallel VLSI architecture; signal processing; Acoustic noise; Arithmetic; Fourier transforms; Signal processing; Signal processing algorithms; Solid modeling; Spectral analysis; Speech processing; Two dimensional displays; Very large scale integration;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/78.611235
Filename :
611235
Link To Document :
بازگشت