Description: 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
To Search:
File list (Check if you may need any files):
myproject
.........\Fast Fourier Transform.csproj
.........\Fast Fourier Transform.sln
.........\MainFrm.cs
.........\MainFrm.Designer.cs
.........\MainFrm.resx
.........\Program.cs
.........\Properties
.........\..........\AssemblyInfo.cs
.........\..........\Resources.Designer.cs
.........\..........\Resources.resx
.........\..........\Settings.Designer.cs
.........\..........\Settings.settings
.........\bin
.........\...\Debug
.........\...\.....\AxInterop.Project1.dll
.........\...\.....\Fast Fourier Transform.exe
.........\...\.....\Fast Fourier Transform.vshost.exe
.........\...\.....\Interop.Project1.dll
.........\...\.....\Interop.VBRUN.dll
.........\FFT.cs
Download