Search - pattern recognition

Search - pattern recognition - List

[uCOS] KeygenCircuitMakerV6.0Pro DL : 0: 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 theory and number theory. The fast Fourier Transform is a highly efficient procedure for computing the DFT of a finite series and requires less number of computations than that of direct evaluation of DFT. It reduces the computations by taking advantage of the fact that the calculation of the coefficients of the DFT can be carried out iteratively. Due to this, FFT computation technique is used in digital spectral analysis, filter simulation, autocorrelation and pattern recognition.
Date : 2026-01-10 Size : 2kb User : Quoc Viet Ta
[uCOS] 6054 DL : 0: Pattern Recognition bayes discriminant analysis algorithm, Can realize the two-dimensional data clustering, A window function design FIR digital band-pass filter.
Date : 2026-01-10 Size : 148kb User : 高军
[uCOS] rf324 DL : 0: Simulation of the effect is very good, High simulation efficiency, BP neural network function fitting and pattern recognition.
Date : 2026-01-10 Size : 147kb User : koujenlangfao