Efficient algorithm for 2-D arithmetic Fourier transform

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 1997-08, Vol.45 (8), p.2136-2140
Main Authors: GE, X.-J, CHEN, N.-X, CHEN, Z.-D
Format: Article
Language:English
Subjects:
Acoustic noise
Applied sciences
Arithmetic
Exact sciences and technology
Fourier transforms
Information, signal and communications theory
Mathematical methods
Signal processing
Signal processing algorithms
Solid modeling
Spectral analysis
Speech processing
Telecommunications and information theory
Two dimensional displays
Very large scale integration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1053-587X
1941-0476
DOI:10.1109/78.611235