A Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group the

Pattern Recognition bayes discriminant analysis algorithm, Can realize the two-dimensional data clustering, A window function design FIR digital band-pass filter.

Simulation of the effect is very good, High simulation efficiency, BP neural network function fitting and pattern recognition.