Mathematical analysis

Fft Matlab Code

A fast Fourier transform (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. Fourier analysis converts time (or space) to frequency and vice versa; an FFT rapidly computes such transformations by factorizing the DFT matrix into a product of sparse (mostly zero) factors.

Radix-2 FFT

Radix-2 FFT

Fft split split the fft of two real sequences in matlab

The following Matlab project contains the source code and Matlab examples used for fft split split the fft of two real sequences. function [X1 X2] = fft_split(X) x = x1 + 1i*x2; X = fft(x); X1 = fft(x1); X2 = fft(x2); This operation is useful when the FFTs of two real-valued sequences have to be computed at the same time, on a platform with limited resources, for example a small DSP or FPGA.
The following VB.NET project contains the source code and VB.NET examples used for Magic Square - Iterative Algorithm. Solve a 15 sum square magic game.
The following VB.NET project contains the source code and VB.NET examples used for Solve equation systems by Gauss method. This VB.
The following VB.NET project contains the source code and VB.NET examples used for Simulated Annealing algorithm . The purpose of the program is the implementation of Simulated Annealing algorithm.

Pages

Subscribe to RSS - Mathematical analysis