A high speed classifier using the arithmetic Fourier transform

A method for computing the Fourier coefficients of a complex valued periodic function resulting from tracing the contour of a closed shape using the arithmetic Fourier transform (AFT) is presented. It requires only simple addition operations, thus saving computational time and load. The algorithm is suitable for parallel computation and has a good match with VLSI implementation. It is useful in pattern recognition. Results obtained from simulation studies show that the method is both accurate and efficient.<>