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

Fractional Fourier transform computing, Mainly for data analysis and statistics, Including regression analysis and probability and statistics.

Mutual information is useful to calculate a set of procedures, Time series data analysis Mellin transform tool, You can get a very accurate amplitude, frequency, phase estimation.

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.

Based on wavelet transform digital watermarking algorithm matlab code, The commonly used digital signal modulation based on artificial neural network, The true extent of the value of the intermediary measure, measure the true extent of the agency bas