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

Modulated signals to calculate its density Pu-related, Acquisition and Processing of the speech signal, digital signal processing class-based, Gabor wavelet transform and PCA face recognition code.

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

Convolution operation is intended to signal and image rendering, Course designed to prepare the matlab program code, To achieve the recognition of 10 digital sound.